• Publications
  • Influence
Edinburgh LCF
  • 144
  • 30
The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus
  • C. P. Wadsworth
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 September 1976
TLDR
A prominent feature of the lattice-theoretic approach to the theory of computation due to D. Scott is the construction of solutions for isomorphic domain equations. Expand
  • 269
  • 23
Edinburgh lcf: a mechanized logic of computation
TLDR
In this age of modern era, the use of internet must be maximized. Expand
  • 295
  • 23
A Metalanguage for interactive proof in LCF
TLDR
LCF (Icqic for Caqmtable Functions) is a prcof generating system mnsisting of an interactive programing language MG (MetaLmguage) for mnducting prcofs in PPA (Polynmrphic Predicate A-calculus) . Expand
  • 160
  • 5
  • PDF
Approximate Reduction and Lambda Calculus Models
TLDR
This paper gives the technical details and proofs for the notion of approximate reduction introduced in an earlier paper. Expand
  • 38
  • 5
Continuations: A Mathematical Semantics for Handling Full Jumps
TLDR
This paper describes a method of giving the mathematical semantics of a programming language which includes a very general form of jump (goto statement). Expand
  • 196
  • 4
  • PDF
Continuations Revisited
To introduce the republication of his joint 1974 paper with Christopher Strachey, “Continuations: A Mathematical Semantics for Handling Full Jumps”, the author recalls earlier unsuccessful strugglesExpand
  • 21
Toward a Model for Shared Data Abstraction with Performance
TLDR
This paper demonstrates the utility of typed shared data abstractions as an effective high-level means of structuring and coordinating parallel programs, showing that SADTs are compatible with efficient and scalable implementation. Expand
  • 9
  • PDF
Towards a theory of shared data in distributed systems
TLDR
We have developed a theory of sharing which captures the behaviour of programs with respect to shared data into the framework of process algebra. Expand
  • 4
  • PDF
Towards a Model for Shared Data Abstraction with Performance 2 by
This paper demonstrates the utility of typed shared data abstractions as an effective high-level means of structuring and coordinating parallel programs. Access to data shared by concurrent processesExpand
  • 4
...
1
2
...