The following pages link to (Q5610115):
Displayed 42 items.
- A scalable module system (Q391632) (← links)
- Preface to the special volume (Q534064) (← links)
- Representing model theory in a type-theoretical logical framework (Q654913) (← links)
- Obituary: Nicolaas Govert de Bruijn (1918--2012). Mathematician, computer scientist, logician (Q740456) (← links)
- Telescopic mappings in typed lambda calculus (Q757027) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Supporting the formal verification of mathematical texts (Q865656) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- The calculus of constructions (Q1108266) (← links)
- What does logic have to tell us about mathematical proofs? (Q1135835) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- From constructivism to computer science (Q1274450) (← links)
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- On principal types of combinators (Q1583260) (← links)
- The role of the Mizar mathematical library for interactive proof development in Mizar (Q1663215) (← links)
- Combinatorial topology and constructive mathematics (Q1788338) (← links)
- Inherited extension of many-sorted theories (Q1816347) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- Understanding uniformity in Feferman's explicit mathematics (Q1899146) (← links)
- Towards semantic mathematical editing (Q2348287) (← links)
- Type theory and formalisation of mathematics (Q2399357) (← links)
- Big Math and the one-brain barrier: the tetrapod model of mathematical knowledge (Q2663667) (← links)
- PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems (Q2867939) (← links)
- Automath Type Inclusion in Barendregt’s Cube (Q3194722) (← links)
- Intuitionistic categorial grammar (Q3348895) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE (Q4637941) (← links)
- An introduction to univalent foundations for mathematicians (Q4684362) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- Characteristics of de Bruijn’s early proof checker Automath (Q5089679) (← links)
- Representing Model Theory in a Type-Theoretical Logical Framework (Q5170290) (← links)
- A general proof certification framework for modal logic (Q5236558) (← links)
- Inductive-data-type systems (Q5958292) (← links)
- Expressing computational complexity in constructive type theory (Q6064279) (← links)
- Large-scale formal proof for the working mathematician -- lessons learnt from the ALEXANDRIA project (Q6118809) (← links)