A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Functional programming with λ-tree syntax
2019
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019 - PPDP '19
We present the design of a new functional programming language, MLTS, that uses the lambda-tree syntax approach to encoding bindings appearing within data structures. In this approach, bindings never become free nor escape their scope: instead, binders in data structures are permitted to move to binders within programs. The design of MLTS includes additional sites within programs that directly support this movement of bindings. In order to formally define the language's operational semantics,
doi:10.1145/3354166.3354177
dblp:conf/ppdp/Gerard0S19
fatcat:qtkdac7eizhv5abtuelor33rwi