AbstractThe problem of programming is discussed and a two-stage approach to programming is proposed. This approach would first produce abstract algorithms ignoring efficiency considerations; then it would produce concrete algorithms by the addition of data structuring. The settheoretic language (SETL) is introduced as a suitable vehicle for the formulation of abstract algorithms. An extensive description of SETL and examples of its use are included
We propose an algebraic core calculus for naive or intuitive set theory. We reconstruct a fragment o...
Set-Based Analysis is an efficient and accurate program analysis for higher-order languages. It expl...
We discuss the prototyping language PROSET(Prototyping with Sets) as a language for experimental and...
AbstractA basic set of data types for a set theoretic programming language is presented. The emphasi...
This thesis deals with the relation between computer languages and computer architecture. In particu...
This paper demonstrates that very substantial progress can be made towards a practical system by red...
Set constructs and notations provide in many areas an unprecedented expressive power. Sets are never...
A novel way of programming, which starts with specific details of a particular example and abstract...
. General agreement exists about the usefulness of sets as very highlevel representations of complex...
Set theory is a key component of formal notations such as B, Z and Alloy. Set-based specifications a...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
We propose an algebraic core calculus for naive or intuitive set theory. We reconstruct a fragment o...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
AbstractLDL—Logical Data Language—is a language developed at MCC. The language supports various exte...
We propose an algebraic core calculus for naive or intuitive set theory. We reconstruct a fragment o...
Set-Based Analysis is an efficient and accurate program analysis for higher-order languages. It expl...
We discuss the prototyping language PROSET(Prototyping with Sets) as a language for experimental and...
AbstractA basic set of data types for a set theoretic programming language is presented. The emphasi...
This thesis deals with the relation between computer languages and computer architecture. In particu...
This paper demonstrates that very substantial progress can be made towards a practical system by red...
Set constructs and notations provide in many areas an unprecedented expressive power. Sets are never...
A novel way of programming, which starts with specific details of a particular example and abstract...
. General agreement exists about the usefulness of sets as very highlevel representations of complex...
Set theory is a key component of formal notations such as B, Z and Alloy. Set-based specifications a...
We demonstrate that a uniformity of approach to both the definition and implementation of programmin...
We propose an algebraic core calculus for naive or intuitive set theory. We reconstruct a fragment o...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
AbstractLDL—Logical Data Language—is a language developed at MCC. The language supports various exte...
We propose an algebraic core calculus for naive or intuitive set theory. We reconstruct a fragment o...
Set-Based Analysis is an efficient and accurate program analysis for higher-order languages. It expl...
We discuss the prototyping language PROSET(Prototyping with Sets) as a language for experimental and...