Computational Semantics, Type Theory, and Functional Programming
| Abstract | An emerging standard for polymorphically typed, lazy, purely functional programming is Haskell, a language named after Haskell Curry. Haskell is based on (polymorphically typed) lambda calculus, which makes it an excellent tool for computational semantics | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesSimona Ronchi della Rocca & Luca Roversi (1997). Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59 (3):417-448.
Simona Ronchi Della Rocca & Luca Roversi (1997). Lambda Calculus and Intuitionistic Linear Logic. Studia Logica 59 (3):417-448.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
György E. Révész (1988). Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press.
Chris Hankin (1994). Lambda Calculi: A Guide for the Perplexed. Oxford University Press.
Analytics
Monthly downloads |
Added to index2010-11-21Total downloads17 ( #71,160 of 549,131 )Recent downloads (6 months)3 ( #25,790 of 549,131 )How can I increase my downloads? |
My notes
Discussion
