The Expressiveness of Simple and Second-Order Type Structures

Cited In (38)

Polymorphic extensions of simple type structures. With an application to a bar recursive minimization
About primitive recursive algorithms
Proofs of strong normalisation for second order classical natural deduction
Parameter-reduction of higher level grammars
Iterating on multiple collections in synchrony
A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
Inductive types and type constraints in the second-order lambda calculus
Automatic synthesis of typed \(\Lambda\)-programs on term algebras
A unary representation result for system \(T\)
Finitely stratified polymorphism
An analysis of the Core-ML language: Expressive power and type reconstruction
Algebraic types in PER models
Extensional models for polymorphism
Orders, reduction graphs and spectra
Third-order Idealized Algol with iteration is decidable
Implicit computation complexity in higher-order programming languages
Typing and computational properties of lambda expressions
How to prove representation-independent independence results
From realizability to induction via dependent intersection
A characterization of F-complete type assignments
Polymorphic type inference and containment
Meeting of the Association for Symbolic Ldgic, Washington, DC, 1985
From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
The calculus of dependent lambda eliminations
Informal versus formal mathematics
The semantics of second-order lambda calculus
Inductively defined types in the Calculus of Constructions
System \(T\), call-by-value and the minimum problem
On the metamathematics of the P vs. NP question
Investigations on the dual calculus
Index sets and presentations of complexity classes
On the implementation of abstract data types by programming language constructs
Categorical data types in parametric polymorphism
Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus
Preface to the special volume
Unprovability of theorems of complexity theory in weak number theories
Canonicity and normalization for dependent type theory
A quantitative model for simply typed λ-calculus

This page was built for publication: The Expressiveness of Simple and Second-Order Type Structures

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