Back to Results
First PageMeta Content
Computer science / Normalisation by evaluation / Combinatory logic / Fixed-point combinator / Simply typed lambda calculus / Denotational semantics / Free variables and bound variables / Functional programming / Standard ML / Theoretical computer science / Lambda calculus / Mathematics


Formal Neighbourhoods, Combinatory B¨ohm Trees, and Untyped Normalization by Evaluation Peter Dybjer∗and Denis Kuperberg† February 29, 2008
Add to Reading List

Document Date: 2012-10-25 13:52:51

Open Document

File Size: 155,19 KB

Share Result on Facebook

City

Lyon / /

Company

Sem We / /

Country

France / /

Facility

ENS University of Technology / /

IndustryTerm

neighbourhood systems / logical systems / normalization algorithm / evaluation algorithm / Proof systems / nbe-algorithms / least solution / cartesian product / e -> / /

Organization

ENS University of Technology / /

Person

Peter Dybjer / Bt / Denis Kuperberg / Thierry Coquand / /

Position

operational model / as Aehlig and Joachimski / first author / /

Product

Haskell / Pentax K-x Digital Camera / /

ProgrammingLanguage

Haskell / Standard ML / K / D / /

Technology

functional programming / normalization algorithm / resulting algorithm / evaluation algorithm / /

SocialTag