5 research outputs found
Lambda Calculus with Explicit Recursion
AbstractThis paper is concerned with the study of位-calculus with explicit recursion, namely of cyclic位-graphs. The starting point is to treat a位-graph as a system of recursion equations involving位-terms and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible for first-order term rewriting. Surprisingly, now the confluence property breaks down in an essential way. Confluence can be restored by introducing a restraining mechanism on the substitution operation. This leads to a family of位-graph calculi, which can be seen as an extension of the family of位蟽-calculi (位-calculi with explicit substitution). While the位蟽-calculi treat the let-construct as a first-class citizen, our calculi support the letrec, a feature that is essential to reason about time and space behavior of functional languages and also about compilation and optimizations of program
Functional encapsulation and type reconstruction in a strongly-typed, polymorphic language
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 181-186).by Shail Aditya Gupta.Ph.D
Properties of a First-order Functional Language with Sharing
A calculus and a model for a first-order functional language with sharing is presented. In most implementations of..