uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Psi-calculi in Isabelle
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
2009 (English)In: Theorem Proving in Higher Order Logics, Berlin: Springer-Verlag , 2009, 99-114 p.Conference paper, Published paper (Refereed)
Abstract [en]

Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, giving it an expressive power beyond the applied pi-calculus and the concurrent constraint pi-calculus.

We have formalised psi-calculi in the interactive theorem prover Isabelle using its nominal datatype package. One distinctive feature is that the framework needs to treat binding sequences, as opposed to single binders, in an efficient way. While different methods for formalising single binder calculi have been proposed over the last decades, representations for such binding sequences are not very well explored.

The main effort in the formalisation is to keep the machine checked proofs as close to their pen-and-paper counterparts as possible. We discuss two approaches to reasoning about binding sequences along with their strengths and weaknesses. We also cover custom induction rules to remove the bulk of manual alpha-conversions.

Place, publisher, year, edition, pages
Berlin: Springer-Verlag , 2009. 99-114 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5674
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-109545DOI: 10.1007/978-3-642-03359-9_9ISBN: 978-3-642-03358-2 (print)OAI: oai:DiVA.org:uu-109545DiVA: diva2:272791
Conference
TPHOLs 2009
Projects
UPMARC
Available from: 2009-10-16 Created: 2009-10-16 Last updated: 2013-12-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Bengtson, JesperParrow, Joachim

Search in DiVA

By author/editor
Bengtson, JesperParrow, Joachim
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 581 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf