Sciweavers

136 search results - page 5 / 28
» Typed Logical Variables in Haskell
Sort
View
LISP
2008
105views more  LISP 2008»
13 years 8 months ago
Proving operational termination of membership equational programs
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...
Francisco Durán, Salvador Lucas, Claude Mar...
TBILLC
2005
Springer
14 years 2 months ago
Natural Logic for Natural Language
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ļ...
Jan van Eijck
APAL
2008
90views more  APAL 2008»
13 years 8 months ago
On the unity of duality
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....
Noam Zeilberger
LICS
2005
IEEE
14 years 2 months ago
Semantics of Separation-Logic Typing and Higher-Order Frame Rules
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...
Lars Birkedal, Noah Torp-Smith, Hongseok Yang
ASPLOS
2006
ACM
14 years 2 months ago
Type inference for unboxed types and first class mutability
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...
Swaroop Sridhar, Jonathan S. Shapiro