Typed Embedding of a Relational Language in OCaml

Kosarev, Dmitrii; Boulytchev, Dmitry

doi:10.4204/eptcs.285.1

Cited by 5 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first example arose in the context of our work on strongly typed logical DSL for OCAML [19]. One of the most important construct there was a unification of terms with free logical variables, and dealing with such data structures involves a lot of tedious and error-prone work.…”

Section: Typed Logic Valuesmentioning

confidence: 99%

See 1 more Smart Citation

Generic Programming with Combinators and Objects

Kosarev¹,

Boulytchev²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We present a generic programming framework for OCAML which makes it possible to implement extensible transformations for a large scale of type definitions. Our framework makes use of objectoriented features of OCAML, utilising late binding to override the default behaviour of generated transformations. The support for polymorphic variant types complements the ability to describe composable data types with the ability to implement composable transformations.

show abstract

Section: Typed Logic Valuesmentioning

confidence: 99%

“…This idea in the form of a certain design pattern was successfully evaluated [5] and then reified in a library and a syntax extension [4]. Our follow-up experience with the library [19] has (once again) shown some flaws in the implementation. The version we present here is almost a complete re-implementation with these flaws fixed.…”

Section: Introductionmentioning

confidence: 99%

Generic Programming with Combinators and Objects

Kosarev¹,

Boulytchev²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…This paper is a literate Haskell file, and we invite interested readers to download the Haskell version of the paper to experiment with, and extend, the framework we present. 1 Related Previous Lines of Work The techniques that we develop in this paper are closely related to the techniques used for relational programming, pioneered by Friedman and Byrd in miniKanren [5,8,16,22], a language for relational programming and constraint logic programming, which has been implemented in a wide range of different languages; notably Scheme [7,16], but also, e.g., OCaml [30]. The miniKanren language and many of its implementations have been developed and researched for more than a decade, with new developments and improvements appearing each year, such as new and better heuristics for guiding the exploration of execution paths [34].…”

Section: Introductionmentioning

confidence: 99%

From definitional interpreter to symbolic executor

Mensing

Antwerpen

Poulsen

et al. 2019

Proceedings of the 4th ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection

View full text Add to dashboard Cite

Symbolic execution is a technique for automatic software validation and verification. New symbolic executors regularly appear for both existing and new languages and such symbolic executors are generally manually (re)implemented each time we want to support a new language. We propose to automatically generate symbolic executors from language definitions, and present a technique for mechanically (but as yet, manually) deriving a symbolic executor from a definitional interpreter. The idea is that language designers define their language as a monadic definitional interpreter, where the monad of the interpreter defines the meaning of branch points. Developing a symbolic executor for a language is a matter of changing the monadic interpretation of branch points. In this paper, we illustrate the technique on a language with recursive functions and pattern matching, and use the derived symbolic executor to automatically generate test cases for definitional interpreters implemented in our defined language. CCS Concepts • Theory of computation → Program schemes; • Software and its engineering → Formal methods; Automatic programming.

show abstract