Algebras and combinators

From MaRDI portal
Publication:1162534

DOI10.1007/BF02483849zbMath0482.08005MaRDI QIDQ1162534

Erwin Engeler

Publication date: 1981

Published in: Algebra Universalis (Search for Journal in Brave)




Related Items (30)

The interpretation of unsolvable λ-terms in models of untyped λ-calculusWhat is a categorical model of the differential and the resource λ-calculi?Easy lambda-terms are not always simpleRelational graph models, Taylor expansion and extensionalityIntersection types and lambda modelsAristotle’s Relations: An Interpretation in Combinatory LogicIntersection type assignment systemsFunctional programming with combinatorsUnnamed ItemUnnamed ItemUnnamed ItemAn irregular filter modelFinite type structures within combinatory algebrasMathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)Some reasons for generalising domain theoryCollapsing partial combinatory algebrasSpaces with combinatorsFrom Böhm's Theorem to Observational EquivalencesTowards Lambda Calculus Order-IncompletenessIntersection Types and Computational RulesIntersection types for \(\lambda\)-treesLazy Lambda calculus: Theories, models and local structure characterizationUnnamed ItemType inference with recursive types: Syntax and semanticsOn combinatory algebras and their expansionsRepresentation of varieties in combinatory algebrasSemantics for dual and symmetric combinatory calculiSet-theoretical models of lambda-calculus: theories, expansions, isomorphismsCompleteness of type assignment in continuous lambda modelsSet-theoretical and other elementary models of the \(\lambda\)-calculus



Cites Work


This page was built for publication: Algebras and combinators