A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine | Zendy

Nikolaos Siafakas | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine

Author(s) -

Nikolaos Siafakas

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.12.040

Subject(s) - multiplicative function , exponential function , lambda calculus , linear logic , reduction (mathematics) , lambda , graph , computer science , path (computing) , calculus (dental) , graph reduction , abstract machine , mathematics , algorithm , algebra over a field , theoretical computer science , geometry , pure mathematics , programming language , mathematical analysis , functional programming , medicine , physics , dentistry , optics

We investigate the possibility of performing new reduction strategies with the Geometry of Interaction Machine (GOIm). To this purpose, we appeal to Lévy's labelled lambda calculus whose labels describe: a) the path that the GOIm will follow in the graph of a term and b) the operations that the GOIm requires to compute the multiplicative part from the Multiplicative and Exponential Linear Logic encoding that the machine uses. Our goal is to unveil the missing exponential information in the structure of the labels. This will provide us with a tool to talk about strategies for computing paths with the GOIm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research