Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Quantitative domains and infinitary algebras
Lamarche F. Theoretical Computer Science94 (1):37-62,1992.Type:Article
Date Reviewed: Dec 1 1992

Using category-theoretic methods and a correspondence between the categories of “spaces” and “algebras,” the author constructs models of the simple (first-order) typed and untyped lambda calculi. Various results on fixpoints in the untyped lambda calculus are then derived using this correspondence. Lamarche also shows how linear logic can be developed using these methods.

Reviewer:  R. W. Wilkerson Review #: CR116519
Bookmark and Share
 
Lambda Calculus And Related Systems (F.4.1 ... )
 
 
Miscellaneous (G.2.m )
 
Would you recommend this review?
yes
no
Other reviews under "Lambda Calculus And Related Systems": Date
Polymorphic rewriting conserves algebraic strong normalization
Breazu-Tannen V., Gallier J. Theoretical Computer Science 83(1): 3-28, 1991. Type: Article
Aug 1 1992
Metacircularity in the polymorphic &lgr;-calculus
Pfenning F. (ed), Lee P. (ed) Theoretical Computer Science 89(1): 137-159, 1991. Type: Article
Nov 1 1992
A characterization of F-complete assignments
Dezani-Ciancaglini M. (ed), Margaria I. Theoretical Computer Science 45(2): 121-157, 1986. Type: Article
Jan 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy