Sciweavers

136 search results - page 6 / 28
» Typed Logical Variables in Haskell
Sort
View
JCSS
2002
114views more  JCSS 2002»
13 years 8 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
ICFP
2003
ACM
14 years 8 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
LMCS
2006
119views more  LMCS 2006»
13 years 8 months ago
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps ...
Lars Birkedal, Noah Torp-Smith, Hongseok Yang
CADE
2000
Springer
14 years 28 days ago
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Carsten Sinz
TPHOL
2007
IEEE
14 years 2 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker