Functional programming with λ$-tree$ syntax: a progress report - Archive ouverte HAL Access content directly
Conference Papers Year :

Functional programming with λ$-tree$ syntax: a progress report

(1) , (1)
1

Abstract

In this progress report, we highlight the design of the functional programming language MLTS which we have recently proposed elsewhere. This language uses the $λ-tree$ syntax approach to encoding data structures that contain bindings. In this setting, bound variables never become free nor escape their scope: instead, binders in data structures are permitted to move into binding sites within programs. The concrete syntax of MLTS is based on the one for OCaml but includes additional binders within programs that directly support the mobility of bindings. The natural semantics of MLTS can be viewed as a logical theory within the logic G , which forms the basis of the Abella proof system and which includes nominal abstractions and the $∇$-quantifier. Here, we provide several examples of MLTS programs. We also illustrate how many Abella relational specifications that are known to specify functions can be rewritten as functions in MLTS.
Fichier principal
Vignette du fichier
paper (1).pdf (147.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01806129 , version 1 (04-06-2018)
hal-01806129 , version 2 (15-06-2018)

Identifiers

  • HAL Id : hal-01806129 , version 2

Cite

Ulysse Gérard, Dale Miller. Functional programming with λ$-tree$ syntax: a progress report. 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2018, Oxford, United Kingdom. ⟨hal-01806129v2⟩
387 View
103 Download

Share

Gmail Facebook Twitter LinkedIn More