<--- Back to Details
First PageDocument Content
Mathematical logic / Models of computation / Theoretical computer science / Model theory / Logic in computer science / Monad / Denotational semantics / Kleisli category / Lambda calculus / Mathematics / Adjoint functors / Software engineering
Date: 2002-07-31 04:29:42
Mathematical logic
Models of computation
Theoretical computer science
Model theory
Logic in computer science
Monad
Denotational semantics
Kleisli category
Lambda calculus
Mathematics
Adjoint functors
Software engineering

Add to Reading List

Source URL: www.disi.unige.it

Download Document from Source Website

File Size: 269,38 KB

Share Document on Facebook

Similar Documents

Remarks on Krivine’s ”Lambda-calculus, types and models”, Chapter 1, §2 Darij Grinberg, 5 JuneIntroduction The point of this note is to 1) add some lemmata to Chapter 1 §2 of [1] (lemmata that are used i

DocID: 1vdfI - View Document

Linear numeral systems Ian Mackie Abstract We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus where terms cannot be copied or erased. Our interest is threefold: representing

DocID: 1uIpL - View Document

Variable-free Formalization of the Curry-Howard Theory W. W. Tait The reduction of the lambda calculus to the theory of combinators in [Sch¨onfinkel, 1924] applies to positive implicational logic, i.e. to the typed lam

DocID: 1ulFW - View Document

Deriving Interpretations of the Gradually-Typed Lambda Calculus Álvaro García-Pérez Pablo Nogueira

DocID: 1tILC - View Document

A Standard Theory for the Pure Lambda-Value Calculus Álvaro García-Pérez Pablo Nogueira

DocID: 1tItY - View Document