Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

FSTTCS
1999
Springer

favoriteEmaildiscussreport

97views Software Engineering» more FSTTCS 1999»

Explicit Substitutions and Programming Languages

13 years 9 months ago

Explicit Substitutions and Programming Languages

Download pauillac.inria.fr

The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get ﬁner properties with respect to gradual implementations of substitutions as eﬀectively done in runtimes of programming languages. But the theory of explicit substitutions has some defects such as non-conﬂuence or the non-termination of the typed case. In this paper, we stress on the sub-theory of weak substitutions, which is suﬃcient to analyze most of the properties of programming languages, and which preserves many of the nice theorems of the λ-calculus.

Jean-Jacques Lévy, Luc Maranget

Real-time Traffic

Explicit Substitutions | FSTTCS 1999 | Logical Systems | Programming Languages | Software Engineering |

claim paper

Related Content

» Explicit substitutions and higherorder syntax

» Linear Explicit Substitutions

» Comparing Calculi of Explicit Substitutions with Etareduction

» Functional Programming With Higherorder Abstract Syntax and Explicit Substitutions

» The Generalised Substitution Language Extended to Probabilistic Programs

» SecondOrder Matching via Explicit Substitutions

» A typetheoretic foundation for programming with higherorder abstract syntax and firstclass...

» Practical Programming with HigherOrder Encodings and Dependent Types

» Explicit Polymorphism and CPS Conversion

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	FSTTCS
Authors	Jean-Jacques Lévy, Luc Maranget

Comments (0)