Sciweavers

397 search results - page 47 / 80
» The Kell Calculus: Operational Semantics and Type System
Sort
View
CONCUR
2005
Springer
14 years 1 months ago
SOS for Higher Order Processes
d Abstract) MohammadReza Mousavi1 , Murdoch J. Gabbay2 , and Michel A. Reniers1 1 Department of Computer Science, 2 Department of Computer Science, Eindhoven University of Technolo...
Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. R...
ICFP
2002
ACM
14 years 7 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
ENTCS
2006
126views more  ENTCS 2006»
13 years 7 months ago
A Congruence Format for Name-passing Calculi
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
Axelle Ziegler, Dale Miller, Catuscia Palamidessi
FOSSACS
2009
Springer
14 years 2 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
IFM
2000
Springer
104views Formal Methods» more  IFM 2000»
13 years 11 months ago
Structuring Real-Time Object-Z Specifications
This paper presents a means of structuring specifications in real-time Object-Z: an integration of Object-Z with the timed refinement calculus. Incremental modification of classes ...
Graeme Smith, Ian J. Hayes