scientific article
From MaRDI portal
Publication:3216629
zbMath0554.03012MaRDI QIDQ3216629
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models of other mathematical theories (03C65) Combinatory logic and lambda calculus (03B40) Set-theoretic model theory (03C55)
Related Items
Initial algebra semantics for lambda calculi, Logical relations and parametricity -- a Reynolds programme for category theory and programming languages, The Girard-Reynolds isomorphism, The system \({\mathcal F}\) of variable types, fifteen years later, Functional sorts in data type specifications, Parametricity as isomorphism, On completeness and cocompleteness in and around small categories, Logical systems. I: Internal calculi., A higher-order calculus and theory abstraction, The calculus of constructions, 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, On generalized algebraic theories and categories with families, Polymorphic extensions of simple type structures. With an application to a bar recursive minimization, The Girard-Reynolds isomorphism (second edition), Parametricity of extensionally collapsed term models of polymorphism and their categorical properties, Parametric Polymorphism — Universally, Intuitive counterexamples for constructive fallacies, Covariant types, Internal enriched categories, Types, abstraction, and parametric polymorphism, part 2, An intuitionistic set-theoretical model of fully dependent CC, No value restriction is needed for algebraic effects and handlers, Universal properties for universal types in bifibrational parametricity, Bifibrational functorial semantics of parametric polymorphism, A modest model of records, inheritance, and bounded quantification, Comprehending Isabelle/HOL’s Consistency, Unnamed Item, Finitely stratified polymorphism, Subtyping can have a simple semantics, Parametricity for primitive nested types, Equational theories for inductive types, Categorical models of polymorphism, A simple model construction for the Calculus of Constructions, The semantics of second-order lambda calculus, Fixed points in Cartesian closed categories, Functorial polymorphism, Martin Hofmann's Case for Non-Strictly Positive Data Types, From constructivism to computer science, Unnamed Item, Domain theoretic models of polymorphism, Relational Parametricity for Control Considered as a Computational Effect, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
