A category-theoretic characterization of functional completeness

DOI10.1016/0304-3975(90)90122-XzbMath0698.68008MaRDI QIDQ912587

Eugenio Moggi

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Combinatory logiccartesian categoriescombinatory algebrasFunctional languageshigher type recursion theory

Mathematics Subject Classification ID

Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) General topics in the theory of software (68N01) Discrete mathematics in relation to computer science (68R99) Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65)

Related Items (9)

A computable expression of closure to efficient causation ⋮ Categorical models for non-extensional λ-calculi and combinatory logic ⋮ Constructing language processors with algebra combinators ⋮ Categorical models of the differential λ-calculus ⋮ Categorical models of the differential \(\lambda\)-calculus revisited ⋮ Free-algebra models for the \(\pi \)-calculus ⋮ Coproducts of Ideal Monads ⋮ Introduction to Turing categories ⋮ Aspects of Categorical Recursion Theory

Cites Work

• On combinatory algebras and their expansions
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
• Categories of partial maps
• A small complete category
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
• Partiality, cartesian closedness, and toposes
• \(\mathbb{T}^\omega\) as a universal domain
• The lambda calculus, its syntax and semantics
• The completeness theorem for typing lambda-terms
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Models of the lambda calculus
• Effectively given domains and lambda-calculus models
• The hereditary partial effective functionals and recursion theory in higher types
• Categorical combinators
• Lambda‐Calculus Models and Extensionality
• Theorie der Numerierungen I
• Data Types as Lattices
• Can programming be liberated from the von Neumann style?
• What is a model of the lambda calculus?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A category-theoretic characterization of functional completeness