Theoretical Computer Science - Special issue on theories of types and proofs
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
iRho: an imperative rewriting calculus
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Irho: An imperative rewriting calculus
Mathematical Structures in Computer Science
The Polymorphic Rewriting-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductive types in the calculus of algebraic constructions
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
On the relation between sized-types based termination and semantic labelling
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Subtyping, declaratively: an exercise in mixed induction and coinduction
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
RECURSIVE MODELS OF GENERAL INDUCTIVE TYPES
Fundamenta Informaticae
Formal program optimization in nuprl using computational equivalence and partial types
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |