Sciweavers

86 search results - page 5 / 18
» Constructive Data Refinement in Typed Lambda Calculus
Sort
View
POPL
2008
ACM
14 years 8 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
PLDI
2005
ACM
14 years 1 months ago
Permission-based ownership: encapsulating state in higher-order typed languages
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
Neelakantan R. Krishnaswami, Jonathan Aldrich
FOSSACS
2010
Springer
14 years 2 months ago
Monads Need Not Be Endofunctors
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
ENTCS
2006
89views more  ENTCS 2006»
13 years 7 months ago
A Type-theoretic Reconstruction of the Visitor Pattern
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
Peter Buchlovsky, Hayo Thielecke
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
The Calculus of Algebraic Constructions
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...
Frédéric Blanqui, Jean-Pierre Jouann...