Lambda calculus with explicit recursion

DOI10.1006/INCO.1997.2651zbMATH Open0892.68015OpenAlexW2088482003MaRDI QIDQ1383145FDOQ1383145

Authors: Zena M. Ariola, Jan Willem Klop 

Publication date: 15 July 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1293

Recommendations

• Explicit cyclic substitutions
• Skew confluence and the lambda calculus with letrec
• scientific article; zbMATH DE number 1088036

zbMATH Keywords

\(\lambda\)-calculus with explicit recursioncyclic \(\lambda\)-graphs

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Combinatory reduction systems: Introduction and survey
• Title not available (Why is that?)
• Deforestation: Transforming programs to eliminate trees
• LEAN: An intermediate language based on graph rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Transformation System for Developing Recursive Programs
• Infinitary lambda calculus
• The call-by-need lambda calculus
• A new implementation technique for applicative languages
• Title not available (Why is that?)
• Properties of a first-order functional language with sharing
• Title not available (Why is that?)
• Explicit substitutions
• Transfinite reductions in orthogonal term rewriting systems
• REDEX CAPTURING IN TERM GRAPH REWRITING
• On ``On graph rewritings
• Relating graph and term rewriting via Böhm models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On graph rewritings
• Algebraic approach to single-pushout graph transformation
• Interaction Systems I: The theory of optimal reductions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit cyclic substitutions

Cited In (20)

• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• Lambda calculus with patterns
• A calculus of open modules: call-by-need strategy and confluence
• Sharing in the graph rewriting calculus
• Expressibility in the lambda calculus with \(\mu\)
• Term-graph anti-unification
• A concurrent lambda calculus with futures
• Safety of Nöcker's strictness analysis
• Applications of infinitary lambda calculus
• Repetitive reduction patterns in lambda calculus with \texttt{letrec} (work in progress)
• General recursive functions in a very simply interpretable typed \(\lambda\)-calculus
• Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
• Skew confluence and the lambda calculus with letrec
• Term graph rewriting
• Deciding inclusion of set constants over infinite non-strict data structures
• Explicit cyclic substitutions
• A logical framework with higher-order rational (circular) terms
• Convergence in infinitary term graph rewriting systems is simple
• Computational soundness of a call by name calculus of recursively-scoped records
• Towards a sharing strategy for the graph rewriting calculus

Uses Software

• Haskell

This page was built for publication: Lambda calculus with explicit recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383145)