Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CSL
1999
Springer

favoriteEmaildiscussreport

83views Automated Reasoning» more CSL 1999»

Monadic Presentations of Lambda Terms Using Generalized Inductive Types

13 years 8 months ago

Monadic Presentations of Lambda Terms Using Generalized Inductive Types

Download www.cs.nott.ac.uk

Thorsten Altenkirch, Bernhard Reus

Real-time Traffic

Automated Reasoning | CSL 1999 |

claim paper

Related Content

» Map fusion for nested datatypes in intensional type theory

» Monadic augment and generalised short cut fusion

» Rewriting Calculus without Types

» Reasoning with hypothetical judgments and open terms in hybrid

» Extensional normalisation and typedirected partial evaluation for typed lambda calculus wi...

» Recognizability in the Simply Typed LambdaCalculus

» Monads for incremental computing

» Recursion on Nested Datatypes in Dependent Type Theory

» Discriminative sum types locate the source of type errors

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	CSL
Authors	Thorsten Altenkirch, Bernhard Reus

Comments (0)