Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Scherer, Gabriel"'
We propose a new language feature for ML-family languages, the ability to selectively unbox certain data constructors, so that their runtime representation gets compiled away to just the identity on their argument. Unboxing must be statically rejecte
Externí odkaz:
http://arxiv.org/abs/2311.07369
Publikováno v:
The Art, Science, and Engineering of Programming, 2024, Vol. 8, Issue 1, Article 3
A compiler consists of a sequence of phases going from lexical analysis to code generation. Ideally, the formal verification of a compiler should include the formal verification of each component of the tool-chain. An example is the CompCert project,
Externí odkaz:
http://arxiv.org/abs/2306.12411
Publikováno v:
The Art, Science, and Engineering of Programming, 2022, Vol. 6, Issue 3, Article 13
Context: It is common for programming languages that their reference implementation is implemented in the language itself. This requires a "bootstrap": a copy of a previous version of the implementation is provided along with the sources, to be able
Externí odkaz:
http://arxiv.org/abs/2202.09231
OCaml function calls consume space on the system stack. Operating systems set default limits on the stack space which are much lower than the available memory. If a program runs out of stack space, they get the dreaded "Stack Overflow" exception -- t
Externí odkaz:
http://arxiv.org/abs/2102.09823
For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness. Why do the
Externí odkaz:
http://arxiv.org/abs/1908.09123
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, binde
Externí odkaz:
http://arxiv.org/abs/1908.03619
Autor:
Lindley, Sam, Scherer, Gabriel
Publikováno v:
EPTCS 294, 2019
This volume contains the joint post-proceedings of the 2017 editions of the ML Family Workshop and the OCaml Users and Developers Workshop which took place in Oxford, UK, September 2017, and which were colocated with the ICFP 2017 conference.
Externí odkaz:
http://arxiv.org/abs/1905.05909
In call-by-value languages, some mutually-recursive value definitions can be safely evaluated to build recursive functions or cyclic data structures, but some definitions (let rec x = x + 1) contain vicious circles and their evaluation fails at runti
Externí odkaz:
http://arxiv.org/abs/1811.08134
In modern OCaml, single-argument datatype declarations (variants with a single constructor, records with a single field) can sometimes be `unboxed'. This means that their memory representation is the same as their single argument (omitting the varian
Externí odkaz:
http://arxiv.org/abs/1811.02300
We report on the experience of developing Merlin, a language server for the OCaml programming language in development since 2013. Merlin is a daemon that connects to your favourite text editor and provides services that require a fine-grained underst
Externí odkaz:
http://arxiv.org/abs/1807.06702