A short and flexible proof of Strong Normalization for the Calculus of Constructions

Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension theorem in process algebra, p. 17. Job Shop Scheduling by Constraint Satisfaction, p. 22. A Hierarchical Membership Protocol for Synchronous Distributed Systems, p. 43. Temporal operators viewed as predicate transformers, p. 11. Automatic Verification of Regular Protocols in P/T Nets, p. 23. A taxomomy of finite automata construction algorithms, p. 87. A taxonomy of finite automata minimization algorithms, p. 23. A precise clock synchronization protocol,p. Trcewidth and Patwidth of Cocomparability graphs of Bounded Dimension, p. 14. Browsing Semantics in the "Tower" Model, p. 19. Verifying Sequentially Consistent Memory using Interface Refinement, p. 20. The object-oriented paradigm, p. 28. 94/02 F. Kamareddine R.P. Nederpelt 94/03 L.B. Hartman K.M. van Hee 94/04 J.C.M. Baeten J.A. Bergstra 94/05 P. Zhou J. Hooman 94/06 T. Basten T. Kunz J. Black M. Coffin D. Taylor 94/07 K.R. Apt R. Bol 94/08 O.S. van Roosmalen 94/09 J. C.M. Baeten J.A. Bergstra 94/10 T. verhoeff 94/11 J. Peleska C. Huizing C. Petersohn 94/12 T. KIoks D. Kratsch H. Miiller

[1]  Herman Geuvers,et al.  Modularity of strong normalization and confluence in the algebraic-/spl lambda/-cube , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[2]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[3]  Stefano Berardi.  Encoding of data types in pure construction calculus: a semantic justification , 1993 .

[4]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[5]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[6]  Bengt Nordström,et al.  Programming in Martin-Löf's Type Theory , 1990 .

[7]  Thierry Coquand,et al.  An Analysis of Girard's Paradox , 1986, LICS.

[8]  C.-H. Luke Ong,et al.  A Generic Strong Normalization Argument: Application to the Calculus of Constructions , 1993, CSL.

[9]  Healfdene Goguen.  A typed operational semantics for type theory , 1994 .

[10]  Jan Terlouw,et al.  Strong Normalization in Type Systems: A Model Theoretic Approach , 1995, Ann. Pure Appl. Log..

[11]  W. Ferrer,et al.  Abstract reduction and topology , 1993 .

[12]  P. Martin-Löf.  An Intuitionistic Theory of Types: Predicative Part , 1975 .

[13]  Herman Geuvers,et al.  On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[14]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[15]  Dieter Kratsch,et al.  Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph , 1995, Inf. Process. Lett..

[16]  P. Martin-Löf.  Constructive mathematics and computer programming , 1984 .

[17]  Zhaohui Luo.  An extended calculus of constructions , 1990 .

[18]  Fairouz Kamareddine,et al.  Non well-foundedness and type freeness can unify the interpretation of functional application , 1992 .

[19]  J. Gallier,et al.  A Proof of Strong Normalization for the Theor y of Constructions Using a Kripke-like Interpretation , 1990 .

[20]  C. W. A. M. van Overveld,et al.  Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling , 1994 .

[21]  J. H. Geuvers.  Logics and type systems , 1993 .

[22]  J. Gallier.  On Girard's "Candidats de Reductibilité" , 1989 .

[23]  Bruce W. Watson,et al.  The design and implementation of the FIRE engine : a C++ toolkit for finite automata and regular expressions , 1994 .

[24]  Edinburgh , 1875 .

[25]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[26]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[27]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[28]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[29]  Per Martin-Löf,et al.  Intuitionistic type theory , 1984, Studies in proof theory.

[30]  T. Coquand,et al.  Metamathematical investigations of a calculus of constructions , 1989 .

[31]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[32]  J. Girard,et al.  Proofs and types , 1989 .

[33]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[34]  W. Tait.  A realizability interpretation of the theory of species , 1975 .

[35]  Kees M. van Hee,et al.  Transforming Functional Database Schemes to Relational Representations , 1992, Specifications of Database Systems.

[36]  Andre Scedrov,et al.  A guide to polymorphic types , 1990 .

[37]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[38]  Mark-Jan Nederhof,et al.  Modular proof of strong normalization for the calculus of constructions , 1991, Journal of Functional Programming.

[39]  Thorsten Altenkirch,et al.  Constructions, inductive types and strong normalization , 1993, CST.

[40]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[41]  W. Tait.  Infinitely Long Terms of Transfinite Type , 1965 .

[42]  Zhaohui Luo,et al.  ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.