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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-11-21

Downloads
58 (#271,353)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jan Van Eijck
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references