License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.EVCS.2023.24
URN: urn:nbn:de:0030-drops-177948
Go to the corresponding OASIcs Volume Portal

Steimann, Friedrich

A Simply Numbered Lambda Calculus

OASIcs-EVCS-2023-24.pdf (0.6 MB)


While programming languages traditionally lean towards functions, query languages are often relational in character. Taking the relations language of Harkes and Visser as a starting point, I explore how the functional paradigm, represented by the lambda calculus, can be extended to form the basis of a relational language. It turns out that a straightforward extension with strings of terms not only supports surprisingly many features of the relations language, but also opens it up for higher-order relations, one prominent feature the relations language does not offer.

BibTeX - Entry

  author =	{Steimann, Friedrich},
  title =	{{A Simply Numbered Lambda Calculus}},
  booktitle =	{Eelco Visser Commemorative Symposium (EVCS 2023)},
  pages =	{24:1--24:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-267-9},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{109},
  editor =	{L\"{a}mmel, Ralf and Mosses, Peter D. and Steimann, Friedrich},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-177948},
  doi =		{10.4230/OASIcs.EVCS.2023.24},
  annote =	{Keywords: multiplicities, strings, lambda calculus, relational programming}

Keywords: multiplicities, strings, lambda calculus, relational programming
Collection: Eelco Visser Commemorative Symposium (EVCS 2023)
Issue Date: 2023
Date of publication: 21.03.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI