scientific article; zbMATH DE number 3556025
From MaRDI portal
Publication:4128535
zbMath0357.02023MaRDI QIDQ4128535
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Easy lambda-terms are not always simple ⋮ Graph easy sets of mute lambda terms ⋮ Easiness in graph models ⋮ Finite generation and presentation problems for lambda calculus and combinatory logic ⋮ On the Jacopini technique ⋮ On polymorphic types of untyped terms ⋮ Collapsing partial combinatory algebras ⋮ Forcing in stable models of untyped \(\lambda\)-calculus ⋮ Infinite \(\lambda\)-calculus and types ⋮ Simple Easy Terms ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Kripke-style models for typed lambda calculus ⋮ Some new results on easy lambda-terms
This page was built for publication:
