We present an algebra that is intended to bridge the gap between programming formalisms that have a high level of abstraction and the operational interpretations these formalisms have been designed to capture. In order to piece a high-level formalism sound for its intended operational interpretation, one needs a mathematical handle on the latter. To this end we design the computation calculus. As an expression mechanism, it is sufficiently transparent to avoid begging the question. As an algebra, it is quite powerful and relatively simple. (C) 2000 Published by Elsevier Science B.V. All rights reserved.</p
AbstractThe paper describes a language consisting of two layers, terms and computation rules, whose ...
AbstractPredicate abstraction is a form of abstract interpretation where the abstract domain is cons...
The key to the integration of formal methods into engineering practice is education. In teaching, do...
We present an algebra that is intended to bridge the gap between programming formalisms that have a ...
AbstractWe present an algebra that is intended to bridge the gap between programming formalisms that...
A large part of the effort in formal program developments is expended on repeating the same derivati...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
In informal mathematical usage we often reason using languages with binding. We usually find ourselv...
We extend the classical first order logic with partially defined iota terms in order to model the wa...
Helmut Schwichtenberg Proofs and computations Formalization and extraction One can extract from a (c...
In this thesis, we aim to formalize the effects of a computation. Indeed, most used programming lang...
AbstractProof theory can be applied to the problem of specifying and reasoning about the operational...
The calculus formalises human intuition and common sense about space, time, and causality in the nat...
AbstractThe paper describes a language consisting of two layers, terms and computation rules, whose ...
AbstractPredicate abstraction is a form of abstract interpretation where the abstract domain is cons...
The key to the integration of formal methods into engineering practice is education. In teaching, do...
We present an algebra that is intended to bridge the gap between programming formalisms that have a ...
AbstractWe present an algebra that is intended to bridge the gap between programming formalisms that...
A large part of the effort in formal program developments is expended on repeating the same derivati...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliabil-...
In informal mathematical usage we often reason using languages with binding. We usually find ourselv...
We extend the classical first order logic with partially defined iota terms in order to model the wa...
Helmut Schwichtenberg Proofs and computations Formalization and extraction One can extract from a (c...
In this thesis, we aim to formalize the effects of a computation. Indeed, most used programming lang...
AbstractProof theory can be applied to the problem of specifying and reasoning about the operational...
The calculus formalises human intuition and common sense about space, time, and causality in the nat...
AbstractThe paper describes a language consisting of two layers, terms and computation rules, whose ...
AbstractPredicate abstraction is a form of abstract interpretation where the abstract domain is cons...
The key to the integration of formal methods into engineering practice is education. In teaching, do...