scientific article

zbMath1272.68173MaRDI QIDQ2851046

Horatiu Cirstea, Claude Kirchner, Luigi Liquori

Publication date: 2 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105825265

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Expressing combinatory reduction systems derivations in the rewriting calculus ⋮ A \(\rho\)-calculus of explicit constraint application ⋮ Twenty years of rewriting logic ⋮ Type soundness for path polymorphism ⋮ Recursive Functions with Pattern Matching in Interaction Nets ⋮ From Functional Programs to Interaction Nets via the Rewriting Calculus

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lambda calculus with patterns
• The system \({\mathcal F}\) of variable types, fifteen years later
• A syntactic theory of sequential state
• Combinatory reduction systems: Introduction and survey
• Abstract data type systems
• Mobile ambients
• A typed pattern calculus
• Uniform proofs as a foundation for logic programming
• The rewriting calculus - part II
• Pure patterns type systems
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• A formulation of the simple theory of types

This page was built for publication: