scientific article; zbMATH DE number 3882404
From MaRDI portal
Publication:3216629
zbMATH Open0554.03012MaRDI QIDQ3216629FDOQ3216629
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
Combinatory logic and lambda calculus (03B40) Set-theoretic model theory (03C55) Models of other mathematical theories (03C65)
Cited In (55)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization
- A modest model of records, inheritance, and bounded quantification
- Relational Parametricity for Control Considered as a Computational Effect
- Types, abstraction, and parametric polymorphism, part 2
- Covariant types
- Title not available (Why is that?)
- Initial algebra semantics for lambda calculi
- Title not available (Why is that?)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Functional sorts in data type specifications
- Intuitive counterexamples for constructive fallacies
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
- Finitely stratified polymorphism
- Equational theories for inductive types
- Parametricity for primitive nested types
- A simple model construction for the Calculus of Constructions
- Extensional models for polymorphism
- Title not available (Why is that?)
- Title not available (Why is that?)
- From constructivism to computer science
- The system \({\mathcal F}\) of variable types, fifteen years later
- Universal properties for universal types in bifibrational parametricity
- Polynat in PER models
- An intuitionistic set-theoretical model of fully dependent CC
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Girard-Reynolds isomorphism (second edition)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical systems. I: Internal calculi.
- The semantics of second-order lambda calculus
- Bifibrational functorial semantics of parametric polymorphism
- Parametric Polymorphism — Universally
- Fixed points in Cartesian closed categories
- Title not available (Why is that?)
- Subtyping can have a simple semantics
- The Girard-Reynolds isomorphism
- A small complete category
- Polymorphism and apartness
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- The calculus of constructions
- Categorical models of polymorphism
- Martin Hofmann's Case for Non-Strictly Positive Data Types
- Internal enriched categories
- Parametricity as isomorphism
- Domain theoretic models of polymorphism
- On completeness and cocompleteness in and around small categories
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- On generalized algebraic theories and categories with families
- No value restriction is needed for algebraic effects and handlers
- Title not available (Why is that?)
- A higher-order calculus and theory abstraction
- Comprehending Isabelle/HOL’s Consistency
- Functorial polymorphism
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216629)
