Information and Computation - Semantics of Data Types
Proofs and types
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Polymorphic rewriting conserves algebraic strong normalization
Selected papers of the 16th international colloquium on Automata, languages, and programming
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Theoretical Computer Science - Special issue: algebraic development techniques
A Module Calculus for Pure Type Systems
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
A short and flexible proof of Strong Normalization for the Calculus of Constructions
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
COLOG '88 Proceedings of the International Conference on Computer Logic
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Higher-order termination: from kruskal to computability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Static and user-extensible proof checking
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Consistency and completeness of rewriting in the calculus of constructions
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Extensionality in the calculus of constructions
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Inductive consequences in the calculus of constructions
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Continuous semantics for strong normalization
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability closure: ten years later
Rewriting Computation and Proof
Rewriting Computation and Proof
| Hi-index | 0.00 |
This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive types equipped with higher-order primitive recursion, by providing definitions of functions by pattern-matching which capture recursor definitions for arbitrary non-dependent and non-polymorphic inductive types satisfying a strictly positivity condition. CAC also generalizes the first-order framework of abstract data types by providing dependent types and higher-order rewrite rules. Full proofs are available at http://www.lri.fr/~blanqui/publis/rta99full.ps.gz.