π-calculus in (Co)inductive-type theory
- 1 February 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 253 (2) , 239-285
- https://doi.org/10.1016/s0304-3975(00)00095-5
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Inductive definitions in the system Coq rules and propertiesPublished by Springer Nature ,2005
- A calculus of mobile processes, IPublished by Elsevier ,2004
- Primitive recursion for higher-order abstract syntaxLecture Notes in Computer Science, 1997
- A theory of bisimulation for the π-calculusActa Informatica, 1996
- Higher-order abstract syntax in CoqPublished by Springer Nature ,1995
- Modal logics for mobile processesTheoretical Computer Science, 1993
- A framework for defining logicsJournal of the ACM, 1993
- The Polyadic π-Calculus: a TutorialPublished by Springer Nature ,1993
- Using typed lambda calculus to implement formal systems on a machineJournal of Automated Reasoning, 1992
- A natural extension of natural deductionThe Journal of Symbolic Logic, 1984