scientific article
From MaRDI portal
Publication:3206926
zbMath0417.03006MaRDI QIDQ3206926
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Easy lambda-terms are not always simple, Graph easy sets of mute lambda terms, Easiness in graph models, On the Jacopini technique, A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\), Intersection types and domain operators, Finite type structures within combinatory algebras, Collapsing partial combinatory algebras, Unfixing the Fixpoint: The Theories of the λY-Calculus, Forcing in stable models of untyped \(\lambda\)-calculus, A \(\kappa\)-denotational semantics for map theory in ZFC+SI, Computability in higher types, P\(\omega\) and the completeness of type assignment, On the construction of 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, Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms, Some new results on easy lambda-terms, Set-theoretical and other elementary models of the \(\lambda\)-calculus, Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result, Consistency argument and classification problem in \(\lambda\)-calculus
