1194 search results - page 89 / 239 » A Calculus for Predicative Programming |
166
click to vote
ACL2
2006
ACM
15 years 8 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
110
click to vote
FASE
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...
114
click to vote
CONCUR
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
125
click to vote
ROOM
2000
15 years 3 months ago
2000
This paper is a proposal for a new two-tier calculus, designed to model aspects of CORBA-like systems at the CORBA evel. The higher object level known as Oompa abstracts away from...
131
Voted
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...