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
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
. The goal of foundational thinking in computer science is to understand the methods and practices o...
While the state of the art is relatively sophisticated in programming language support for computer ...
AbstractWe present an algebra that is intended to bridge the gap between programming formalisms that...
We present an algebra that is intended to bridge the gap between programming formalisms that have a ...
A large part of the effort in formal program developments is expended on repeating the same derivati...
The λ-calculus is considered an useful mathematical tool in the study of programming languages, sinc...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
A large part of the effort in formal program developments i expended on repeating the same derivatio...
Computational implementations are special relations between what is computed and what computes it. T...
AbstractThe paper describes a language consisting of two layers, terms and computation rules, whose ...
In calculational program design one derives implementations from specifications using semantics-pres...
The lamda-calculus is considered an useful mathematical tool in the study of programming languages. ...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
Computing, like mathematics, is the study of reusable abstractions. Abstractions in computing includ...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
. The goal of foundational thinking in computer science is to understand the methods and practices o...
While the state of the art is relatively sophisticated in programming language support for computer ...
AbstractWe present an algebra that is intended to bridge the gap between programming formalisms that...
We present an algebra that is intended to bridge the gap between programming formalisms that have a ...
A large part of the effort in formal program developments is expended on repeating the same derivati...
The λ-calculus is considered an useful mathematical tool in the study of programming languages, sinc...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
A large part of the effort in formal program developments i expended on repeating the same derivatio...
Computational implementations are special relations between what is computed and what computes it. T...
AbstractThe paper describes a language consisting of two layers, terms and computation rules, whose ...
In calculational program design one derives implementations from specifications using semantics-pres...
The lamda-calculus is considered an useful mathematical tool in the study of programming languages. ...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
Computing, like mathematics, is the study of reusable abstractions. Abstractions in computing includ...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
. The goal of foundational thinking in computer science is to understand the methods and practices o...
While the state of the art is relatively sophisticated in programming language support for computer ...