scientific article; zbMATH DE number 1088036

zbMath0884.03008MaRDI QIDQ4364384

Stefan Blom, Zena M. Ariola

Publication date: 1 April 1998

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

zbMATH Keywords

confluenceaxiomatizationcall-by-value variantcyclic lambda calculuscyclic lambda-graphsextension of lambda calculus with the \texttt{letrec} constructinfinite normal formLévy-Longo treerewriting under lambda-abstractions and on cycles

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Semantics of value recursion for Monadic Input/Output ⋮ A logical framework with higher-order rational (circular) terms ⋮ Term-Graph Rewriting Via Explicit Paths ⋮ Unnamed Item ⋮ Deciding inclusion of set constants over infinite non-strict data structures ⋮ Skew confluence and the lambda calculus with letrec ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

This page was built for publication: