scientific article; zbMATH DE number 4187810

From MaRDI portal
Revision as of 05:03, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5752573

zbMath0721.03048MaRDI QIDQ5752573

J. M. E. Hyland, Andrew M. Pitts

Publication date: 1989


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

\(F\)-semantics for type assignment systemsTerm graph rewriting and garbage collection using opfibrationsOn completeness and cocompleteness in and around small categoriesA higher-order calculus and theory abstractionParametric Church's thesis: synthetic computability without choiceA category-theoretic account of program modulesQuantitative domains, groupoids and linear logicDictosesSemantics for abstract clausesAn exper model for QuestAlpha conversion, conditions on variables and categorical logicA note on Russell's paradox in locally Cartesian closed categoriesA modest model of records, inheritance, and bounded quantificationInheritance as implicit coercionType checking with universesThe extended calculus of constructions (ECC) with inductive typesA simple model construction for the Calculus of ConstructionsConstructing type systems over an operational semanticsAspects of predicative algebraic set theory. I: Exact completionCombinatorial structure of type dependencyComprehension categories and the semantics of type dependencyOn the semantics of classical disjunctionUnnamed ItemUnnamed ItemFrom exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causalityA constructive theory of continuous domains suitable for implementationNotions of computation and monadsFrom term models to domainsUnnamed ItemEquilogical spacesA natural semantics of first-order type dependency







This page was built for publication: