136 search results - page 5 / 28 » Typed Logical Variables in Haskell |
122
click to vote
LISP
2008
15 years 3 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
105
click to vote
TBILLC
2005
Springer
15 years 8 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ā¤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deļ...
123
click to vote
APAL
2008
15 years 3 months ago
2008
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
136
click to vote
LICS
2005
IEEE
15 years 8 months ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-speciļ¬ed in a version of separation logic for a language with higher types: idealized algol extended with heap...
141
Voted
ASPLOS
2006
ACM
15 years 9 months ago
2006
ACM
Systems programs rely on ļ¬ne-grain control of data representation and use of state to achieve performance, conformance to hardware speciļ¬cation, and temporal predictability. T...