Sciweavers

36 search results - page 1 / 8
» Intersection Type Systems and Explicit Substitutions Calculi
Sort
View
WOLLIC
2010
Springer
13 years 3 months ago
Intersection Type Systems and Explicit Substitutions Calculi
Abstract. The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types p...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
RTA
2007
Springer
13 years 11 months ago
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
Kentaro Kikuchi
CIE
2008
Springer
13 years 6 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
CSL
2007
Springer
13 years 11 months ago
The Theory of Calculi with Explicit Substitutions Revisited
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
Delia Kesner
ENTCS
2011
106views more  ENTCS 2011»
12 years 11 months ago
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
F. L. C. de Moura, A. V. Barbosa, Mauricio Ayala-R...