The Semantics of a Simple Language for Parallel Programming Gilles KAHN IRIA-Laboria, Domaine de Voluceau, 78150 Rocquencourt, France and Commissariat à l’Energie Atomique, France

First Page		Document Content
Date: 2010-09-20 10:06:48 Mathematics Computability theory Computer programming Theoretical computer science Software engineering Subroutines Recursion Continuous function Recurrence relation Computable topology		The Semantics of a Simple Language for Parallel Programming Gilles KAHN IRIA-Laboria, Domaine de Voluceau, 78150 Rocquencourt, France and Commissariat à l’Energie Atomique, France Add to Reading List Source URL: perso.ensta-paristech.fr Download Document from Source Website File Size: 516,97 KB Share Document on Facebook

	A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009 DocID: 1pMn0 - View Document
	Foundations for Computable Topology Paul Taylor 8 April 2009 Abstract Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence DocID: 1kSWN - View Document
	Foundations for Computable Topology Paul Taylor 8 April 2009 Abstract Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence DocID: 1kEtz - View Document
	Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522 DocID: 1gn1D - View Document
	Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522 DocID: 1fwpH - View Document