Copattern matching and first-class observations in OCaml, with a macro - Archive ouverte HAL Access content directly
Conference Papers Year :

Copattern matching and first-class observations in OCaml, with a macro

(1) , (2, 3)
1
2
3

Abstract

Infinite data structures are elegantly defined by means of copattern matching, a dual construction to pattern matching that expresses the outcomes of the observations of an infinite structure. We extend the OCaml programming language with copatterns, exploiting the duality between pattern matching and copattern matching. Pro- vided that a functional programming language has GADTs, every copattern matching can be transformed into a pattern matching via a purely local syntactic transformation, a macro. The development of this extension leads us to a generalization of previous calculus of copatterns: the introduction of first-class observation queries. We study this extension both from a formal and practical point of view.
Fichier principal
Vignette du fichier
laforgue-17.pdf (720.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01653261 , version 1 (01-12-2017)

Identifiers

Cite

Paul Laforgue, Yann Régis-Gianas. Copattern matching and first-class observations in OCaml, with a macro. International Symposium on Principles and Practice of Declarative Programming, Oct 2017, Namur, Belgium. ⟨10.1145/3131851.3131869⟩. ⟨hal-01653261⟩
231 View
644 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More