scientific article; zbMATH DE number 2043523

zbMATH Open1038.68073MaRDI QIDQ4447225FDOQ4447225

Authors: J. B. Wells, Detlef Plump, Fairouz Kamareddine 

Publication date: 16 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2706/27060088.htm

Title of this publication is not available (Why is that?)

Recommendations

• Diagram techniques for confluence
• Diagrammatic Confluence and Completion
• Correctness of program transformations as a termination problem
• Proving confluence of term rewriting systems via persistency and decreasing diagrams
• Decreasing diagrams and relative termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited In (5)

• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• Observational program calculi and the correctness of translations
• Nominal unification with atom and context variables
• Title not available (Why is that?)
• Computational soundness of a call by name calculus of recursively-scoped records

This page was built for publication:

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