1742 search results - page 65 / 349 » An Applicative Module Calculus |
ZUM
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
GG
2008
Springer
13 years 11 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
APAL
2010
13 years 10 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
APAL
2008
13 years 10 months ago
2008
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped -calculus with pattern matching and term rewriting which has the p...
ENTCS
2007
13 years 10 months ago
2007
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...