Systems for Open Terms: An Overview

In this paper we make an overview of some existing systems of open (incomplete) terms including ALF, Typelab, OLEG, Aile, Automath, AC and AS,.

[1]  S. Andova.  Process algebra with interleaving probabilistic parallel composition , 1999 .

[2]  Ag Engels,et al.  Why men (and octopuses) cannot juggle a four ball cascade , 1997 .

[3]  Sjouke Mauw,et al.  Message sequence charts in the software engineering process , 2001 .

[4]  Jos C. M. Baeten,et al.  Specifying internet applications with DiCons , 2001, SAC.

[5]  Herman Geuvers,et al.  Proof-Assistants Using Dependent Type Systems , 2001, Handbook of Automated Reasoning.

[6]  J. Bergstra,et al.  Mode transfer in process algebra , 2000 .

[7]  Rp Rob Nederpelt.  The fine-structure of lambda calculus , 1992 .

[8]  Jan Friso Groote,et al.  An algorithm for the asynchronous Write-All problem based on process collision , 2001, Distributed Computing.

[9]  Mauricio Ayala-Rincón,et al.  Unification via λse-style of explicit substitution , 2000, PPDP '00.

[10]  Jozef Hooman,et al.  Semantical aspects of an architecture for distributed embedded systems , 2000, SAC '00.

[11]  Jos C. M. Baeten,et al.  Real time process algebra with time-dependent conditions , 2001, J. Log. Algebraic Methods Program..

[12]  C. Munoz,et al.  Dependent Types and Explicit Substitutions , 1999 .

[13]  I. D. van den Ende,et al.  Grammars compared : a study on determining a suitable grammar for parsing and generating natural language sentences in order to facilitate the translation of natural language and MSC use cases , 2000 .

[14]  Jcm Jos Baeten,et al.  Process algebra with explicit termination , 2000 .

[15]  Martin Strecker,et al.  Interactive and Automated Proof Construction in Type Theory , 1998 .

[16]  Pierre Lescanne.  From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions. , 1994 .

[17]  Bruno Guillaume.  The λ s e -calculus does not preserve strong normalisation , 2000 .

[18]  Conor McBride,et al.  Dependently typed functional programs and their proofs , 2000 .

[19]  Jjm Jozef Hooman,et al.  A programming-language extension for distributed real-time systems , 1997 .

[20]  van Km Kees Hee,et al.  A framework for component based software architectures , 1999 .

[21]  César Muñoz,et al.  A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory , 1997 .

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

[23]  Hans Zantema,et al.  A rewriting approach to binary decision diagrams , 2001, J. Log. Algebraic Methods Program..

[24]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[25]  Vaj Tijn Borghuis,et al.  Belief revision with explicit justifications : an exploration in type theory , 2000 .

[26]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[27]  de Ng Dick Bruijn.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[28]  R. Veltkamp,et al.  Efficient evaluation of triangular B-splines , 1999 .

[29]  Martín Abadi,et al.  Explicit substitutions , 1989, POPL '90.

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

[31]  Fairouz Kamareddine,et al.  Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms , 1997, J. Funct. Program..

[32]  Jan Friso Groote,et al.  The parallel composition of uniform processes with data , 2001, Theor. Comput. Sci..

[33]  de Ng Dick Bruijn.  A namefree lambda calculus with facilities for internal definition of expressions and segments , 1978 .

[34]  Dragan Bosnacki,et al.  Enhancing partial-order reduction via process clustering , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[35]  Mgj Franssen,et al.  Tools for the construction of correct programs : an overview , 1997 .

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

[37]  H Herman Balsters.  Lambda calculus extended with segments , 1994 .

[38]  Cj Roel Bloo,et al.  Preservation of strong normalisation for explicit substitution , 1995 .

[39]  Jan A. Bergstra,et al.  Deadlock Behaviour in Split and ST Bisimulation Semantics , 1998, EXPRESS.

[40]  Lena Magnusson,et al.  The implementation of ALF : a proof editor based on Martin-Löf's monomorphic type theory with explicit substitution , 1994 .

[41]  Jos C. M. Baeten,et al.  Termination in timed process algebra , 2000 .

[42]  Martijn Oostdijk.  An Interactive Viewer for Mathematical Content Based On Type Theory , 2000 .

[43]  Rr Rob Hoogerwoord.  A formal development of distributed summation , 2000 .

[44]  Martin Strecker,et al.  Construction and deduction in type theories , 1999 .

[45]  Fairouz Kamareddine,et al.  The S-calculus: Its Typed and Its Extended Versions , 1995 .

[46]  van Km Kees Hee,et al.  An analytical method for assessing business processes , 1998 .

[47]  Alejandro Ríos,et al.  A Lambda-Calculus à la de Bruijn with Explicit Substitutions , 1995, PLILP.

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

[49]  Wil M. P. van der Aalst,et al.  Exploring the process dimension of workflow management , 1997 .

[50]  Jozef Hooman,et al.  Process Algebra in PVS , 1999, TACAS.

[51]  Twan Basten,et al.  Partial-Order Process Algebra (and its Relation to Petri Nets) , 2001, Handbook of Process Algebra.

[52]  Roland Carl Backhouse,et al.  Calculating a Round-Robin Scheduler , 1998, MPC.