Results

**1 - 5**of**5**
by G Longo, E Moggi

Venue: | Theoretical Computer Science |

Sorted by:

Results **1 -
5** of
**5**

by
J. R. B. Cockett, Pieter J. W. Hofstra

"... ..."

(Show Context)
Citation Context

...rization. Moreover, they studied these concepts in the context of models of the lambda calculus (being mainly interested in type structures, they concentrated on the cartesian closed case). Later, in =-=[28]-=-, this was generalized to arbitrary combinatory algebras. One of their ideas was to show that every combinatory algebra gave rise to a category with certain properties (which embody the notions of Göd...

by
J. R. B. Cockett
, 2014

"... ..."

(Show Context)
Citation Context

...i) A is combinatory complete (ii) The A-computable morphisms form a cartesian restriction category over C. Proof: We sketch the proof, which is a straightforward extension of the total case proved in =-=[20]-=-. Assume first that A is combinatory complete. By definition, this means that every polynomial map is computable. In particular, the application map is computable, as is every total element. Now if f ...

by
J. R. B. Cockett A, P. J. W. Hofstra B

"... ..."

(Show Context)
Citation Context

...rization. Moreover, they studied these concepts in the context of models of the lambda calculus (being mainly interested in type structures, they concentrated on the cartesian closed case). Later, in =-=[31]-=-, this was generalized to arbitrary total combinatory algebras. One of their ideas was to show that every total combinatory algebra gave rise to a category with certain properties (which embody the no...

by
J. R. B. Cockett
, 2014

"... ..."

(Show Context)
Citation Context

...i) A is combinatory complete (ii) The A-computable morphisms form a cartesian restriction category over C. Proof: We sketch the proof, which is a straightforward extension of the total case proved in =-=[20]-=-. Assume first that A is combinatory complete. By definition, this means that every polynomial map is computable. In particular, the application map is computable, as is every total element. Now if f ...

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University