Skip to main navigation Skip to search Skip to main content

An interaction net encoding of Gödel’s System T declarative pearl

  • Ibaraki University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The graph rewriting system of interaction nets has been very successful for the implementation of the lambda calculus. In this paper we show how the ideas can be extended and simplified to encode Gödel’s System T —the simply typed λ-calculus extended with numbers. Surprisingly, using some results about System T, we obtain a very simple system of interaction nets that is significantly more efficient than a direct encoding for the evaluation of programs.

Original languageEnglish
Title of host publicationFunctional and Logic Programming - 13th International Symposium, FLOPS 2016, Proceedings
EditorsOleg Kiselyov, Andy King
PublisherSpringer Verlag
Pages80-93
Number of pages14
ISBN (Print)9783319296036
DOIs
Publication statusPublished - 1 Jan 2016
Event13th International Symposium on Functional and Logic Programming, FLOPS 2016 - Kochi, Japan
Duration: 4 Mar 20166 Mar 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9613
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Symposium on Functional and Logic Programming, FLOPS 2016
Country/TerritoryJapan
CityKochi
Period4/03/166/03/16

Fingerprint

Dive into the research topics of 'An interaction net encoding of Gödel’s System T declarative pearl'. Together they form a unique fingerprint.

Cite this