The modularity of programming language descriptions allows the designer to describe each programming language feature in a separated module that can be studied independently of ot...
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
Quantum computer programming is emerging as a new subject domain from multidisciplinary research in quantum computing, computer science, mathematics (especially quantum logic, lamb...
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...