Skip to content

Michaelborkowski/benchmarks #1843

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
wants to merge 4 commits into
base: develop
Choose a base branch
from
Draft

Michaelborkowski/benchmarks #1843

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
f113022
Changes to POPL18 PLE benchmarks to get them working with current LH …
michaelborkowski Jun 17, 2021
905de9d
Restore Ackermann.hs and OverviewListInfix.hs in the POPL18 benchmarks
michaelborkowski Jun 17, 2021
48596bf
Restore Ackermann.hs and OverviewListInfix.hs in the POPL18 benchmarks
michaelborkowski Jun 17, 2021
ac48c38
Merge branch 'michaelborkowski/benchmarks' of https://github.com/ucsd…
michaelborkowski Jun 17, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions benchmarks/popl18/nople/neg/Ackermann.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
-- | http://www.cs.yorku.ca/~gt/papers/Ackermann-function.pdf

{-@ LIQUID "--higherorder" @-}
{-@ LIQUID "--autoproofs" @-}
{- @ LIQUID "--autoproofs" @-}

module Ackermann where

Expand Down Expand Up @@ -315,7 +315,7 @@ ladder_prop1 n l x


{-@ ladder_prop2 :: x:Nat -> y:Nat -> n:{Int | 0 < n} -> z:Nat
-> {v:Proof | ladder (x + y) n z == ladder x n (ladder y n z)} / [x] @-}
-> {v:Proof | ladder (x + y) n z == ladder x n (ladder y n z)} / [x] @-}
ladder_prop2 :: Int -> Int -> Int -> Int -> Proof
ladder_prop2 x y n z
| x == 0
Expand All @@ -328,7 +328,7 @@ ladder_prop2 x y n z
==. ladder x n (ladder y n z)

{-@ ladder_prop3 :: x:Nat -> y:{Nat | x < y} -> n:{Int | 0 < n} -> l:Nat
-> {v:Proof | ladder l n x < ladder l n y } @-}
-> {v:Proof | ladder l n x < ladder l n y } @-}
ladder_prop3 :: Int -> Int -> Int -> Int -> Proof
ladder_prop3 x y n l
= proof $
Expand Down
6 changes: 3 additions & 3 deletions benchmarks/popl18/nople/pos/Ackermann.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
-- | http://www.cs.yorku.ca/~gt/papers/Ackermann-function.pdf

{-@ LIQUID "--higherorder" @-}
{-@ LIQUID "--autoproofs" @-}
{- @ LIQUID "--autoproofs" @-}


module Ackermann where
Expand Down Expand Up @@ -314,7 +314,7 @@ ladder_prop1 n l x


{-@ ladder_prop2 :: x:Nat -> y:Nat -> n:{Int | 0 < n} -> z:Nat
-> { ladder (x + y) n z == ladder x n (ladder y n z)} / [x] @-}
-> { ladder (x + y) n z == ladder x n (ladder y n z)} / [x] @-}
ladder_prop2 :: Int -> Int -> Int -> Int -> Proof
ladder_prop2 x y n z
| x == 0
Expand All @@ -326,7 +326,7 @@ ladder_prop2 x y n z
*** QED

{-@ ladder_prop3 :: x:Nat -> y:{Nat | x < y} -> n:{Int | 0 < n} -> l:Nat
-> {ladder l n x < ladder l n y } @-}
-> {ladder l n x < ladder l n y } @-}
ladder_prop3 :: Int -> Int -> Int -> Int -> Proof
ladder_prop3 x y n l
= iack l n x <. iack l n y ? ( ladder_prop1 n l x
Expand Down
2 changes: 1 addition & 1 deletion benchmarks/popl18/nople/pos/OverviewListInfix.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
{-@ LIQUID "--higherorder" @-}
{-@ LIQUID "--exact-data-cons" @-}
{-@ LIQUID "--eliminate" @-}
{- @ LIQUID "--eliminate" @-}
{-@ LIQUID "--maxparams=10" @-}
{-@ LIQUID "--higherorderqs" @-}

Expand Down
Loading