13 search results - page 2 / 3 » Relating Nominal and Higher-order Abstract Syntax Specificat... |
JAR
2007
13 years 6 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
ICFP
2003
ACM
14 years 6 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
FOIS
2001
13 years 7 months ago
2001
The uptake in the software industry of notations for designing systems visually has been accelerated with the standardization of the Unified Modeling Language (UML). The formaliza...
ENTCS
2000
13 years 6 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...