Sciweavers

16 search results - page 3 / 4
» tlca 2007
Sort
View
TLCA
2007
Springer
14 years 3 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
TLCA
2007
Springer
14 years 3 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
TLCA
2007
Springer
14 years 3 months ago
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
José Espírito Santo, Ralph Matthes, ...
TLCA
2007
Springer
14 years 3 months ago
Strong Normalization and Equi-(Co)Inductive Types
e type system for the l—m˜d—E™—l™ulus enri™hed with re™urE sive —nd ™ore™ursive fun™tions over equiEindu™tive —nd E™oindu™tive types is presented in whi™h —ll wel...
Andreas Abel
TLCA
2007
Springer
14 years 3 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek