Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi

DOI10.1017/S0960129500001213MaRDI QIDQ4882489zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Claudio Hermida, Bart Jacobs

Publication date 27 August 1996

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129500001213

zbMATH Keywords

functional completenessfibred categoriespolymorphic lambda calculus2-categories of fibrationscategories with indeterminatescontextual completenessKleisli objects

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Fibered categories (18D30)

Recommendations

• Domain theoretic models of polymorphism
• scientific article; zbMATH DE number 431770
• Strong almost reducibility for analytic and Gevrey quasi-periodic cocycles
• scientific article; zbMATH DE number 4027427

Cites work

• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• The fibrational formulation of intuitionistic predicate logic. I: Completeness according to Gödel, Kripke, and Läuchli. Part 1
• The formal theory of monads
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(9)

• Monoidal indeterminates and categories of possible worlds
• Simply-typed underdeterminism
• Structural induction and coinduction in a fibrational setting
• Monoidal indeterminates and categories of possible worlds
• Some properties of Fib as a fibred \(2\)-category
• On the semantics of the universal quantifier
• System F i
• Decomposing typed lambda calculus into a couple of categorical programming languages
• Elementary control structures

This page was built for publication: Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882489)