Computer Science – Logic in Computer Science
Scientific paper
2009-04-30
Computer Science
Logic in Computer Science
Scientific paper
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotational semantics and equational/order theories of the pure untyped lambda-calculus. The main research achievements include: (i) a general construction of lambda-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stone-style representation theorem for combinatory algebras; (iii) a proof that no effective lambda-model can have lambda-beta or lambda-beta-eta as its equational theory (this can be seen as a partial answer to an open problem introduced by Honsell-Ronchi Della Rocca in 1984).
No associations
LandOfFree
Models and theories of lambda calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Models and theories of lambda calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Models and theories of lambda calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-442844