Sciweavers

137 search results - page 19 / 28
» Polymorphic Directional Types for Logic Programming
Sort
View
ICFP
2010
ACM
13 years 7 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
POPL
2004
ACM
14 years 7 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
LICS
2008
IEEE
14 years 1 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier