A fresh look at the λ-calculus

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

Abstract

The (untyped) λ-calculus is almost 90 years old. And yet – we argue here – its study is far from being over. The paper is a bird’s eye view of the questions the author worked on in the last few years: how to measure the complexity of λ-terms, how to decompose their evaluation, how to implement it, and how all this varies according to the evaluation strategy. The paper aims at inducing a new way of looking at an old topic, focussing on high-level issues and perspectives.

Original languageEnglish
Title of host publication4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019
EditorsHerman Geuvers, Herman Geuvers
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771078
DOIs
Publication statusPublished - 1 Jun 2019
Event4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019 - Dortmund, Germany
Duration: 24 Jun 201930 Jun 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume131
ISSN (Print)1868-8969

Conference

Conference4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019
Country/TerritoryGermany
CityDortmund
Period24/06/1930/06/19

Keywords

  • Abstract machines
  • Rewriting
  • Sharing
  • Type systems
  • λ-calculus

Fingerprint

Dive into the research topics of 'A fresh look at the λ-calculus'. Together they form a unique fingerprint.

Cite this