85 citations · 85 across the 3 of their papers we have counts for
3 papers
cs.PL2017★ 85 cited
Linear Haskell: practical linearity in a higher-order polymorphic language
Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton +2
Linear type systems have a long and storied history, but not a clear path forward to integrate with existing languages such as OCaml or Haskell. In this paper, we study a linear ty…
cs.LO2015
The tree machine
Arnaud Spiwack
A variant of Turing machines is introduced where the tape is replaced by a single tree which can be manipulated in a style akin to purely functional programming. This yields two be…
cs.LO2015
Notes on axiomatising Hurkens's Paradox
Arnaud Spiwack
An axiomatisation of Hurkens's paradox in dependent type theory is given without assuming any impredicative feature of said type theory.