Daniel Hirschkoff  Home/Search
Context Related
| cermics.enpc.fr/~dh/coq/tp.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cermics.enpc.fr/~dh/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A formalisation of pi-calculus in the Coq system is presented. Based on a de Bruijn notation for names, our... (Update)
Context of citations to this paper: More
.... on pi calculus processes, such as the Mobility Workbench [VM94] or Hirschkoff s environment based on the theorem prover COQ [Hir97], appears challenging but promising. By contrast, the technique for barbed equivalence in Sections 7 and 8 does not seem to fit a fully...
Cited by: More
Behavioral Equivalence in the Polymorphic Pi-Calculus - Pierce, Sangiorgi (1999) (Correct)
Active bibliography (related documents): More All
0.5: Verification de l'equivalence du pi-calcul dans HOL - AIT-MOHAMED (1994) (Correct)
0.5: Quantum Computing: A new Paradigm and it's Type Theory - Wehr (1996) (Correct)
0.2: Experiments with Finite Tree Automata in Coq - Rival, al. (2001) (Correct)
Similar documents based on text: More All
0.4: Automatically Proving Up-to Bisimulation - Hirschkoff (1998) (Correct)
0.4: Handling Substitutions Explicitely in the pi-Calculus - Hirschkoff (Correct)
0.3: On the Benefits of Using the Up-To Techniques for Bisimulation.. - Hirschkoff (Correct)
BibTeX entry: (Update)
D. Hirschkoff. A full formalisation of -calculus theory in the calculus of constructions. In Elsa Gunter, editor, Proceedings of the International Conference on Theorem Proving in Higher Order Logics, volume 1275 of Lecture Notes in Computer Science. Springer Verlag, 1997. http://citeseer.ist.psu.edu/hirschkoff97full.html More
@inproceedings{ hirschkoff97full,
author = "Daniel Hirschkoff",
title = "A Full Formalisation of $pi$--Calculus Theory in the Calculus of Constructions",
booktitle = "Theorem Proving in Higher Order Logics",
pages = "153--169",
year = "1997",
url = "citeseer.ist.psu.edu/hirschkoff97full.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992
76 The polyadic -calculus: a tutorial - Milner - 1991
69 calculus as a theory in linear logic: Preliminary results (context) - Miller - 1992
60 Decoding choice encodings - Nestmann, Pierce - 1996
47 On bisimulations for the asynchronous -calculus - Amadio, Castellani et al. - 1996
35 Lambda Calculus Notation with Nameless Dummies: a Tool for A.. (context) - de Bruijn - 1972
32 Pure Type Systems Formalized - Kinna, Pollack - 1993
31 Five Axioms of Alpha-Conversion - Melham, Gordon - 1996
30 Proof by pointing - Bertot, Kahn et al. - 1994
23 Theoretical Computer Science (context) - Stoughton - 1988
21 Residual theory in -calculus: A formal development (context) - Huet - 1993
20 Research Topics in Functional Programming (context) - Abramsky, lambda - 1989
14 INRIA - Sophia Antipolis (context) - Sangiorgi, mobile et al. - 1995
10 ese de doctorat, Universit (context) - Werner, des et al. - 1994
6 A mechanized theory of the -calculus in HOL (context) - Melham - 1994
6 Revised version of Technical Report ECS--LFCS (context) - Sangiorgi, bisimulation - 1995
4 Using reflection to build efficient and certified decision p.. - Boutin - 1996
4 Un calcul de constructions infinies et son application `a la.. - Gim'enez - 1996
2 Programming in the Pi-Calculus (context) - Pierce - 1995
2 A formalisation of the CCS process algebra in higher order l.. (context) - Nesi - 1992
1 equivalence du -calcul dans HOL (context) - Ait-Mohamed - 1994
1 PIC: A proof checker for the -calculus in Higher Order Logic (context) - Ait-Mohamed - 1995
1 Up to context proofs for the -calculus in the Coq system (context) - Hirschkoff - 1997
Documents on the same site (http://cermics.enpc.fr/~dh/): More
Automatically Proving Up-to Bisimulation - Hirschkoff (1998) (Correct)
Incremental Inference of Partial Types - Coppo, Hirschkoff (Correct)
Handling Substitutions Explicitely in the pi-Calculus - Hirschkoff (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC