Purely Functional Lazy Non-deterministic Programming

Sebastian Fischer, Oleg Kiselyov, Chung Chieh Shan

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-determinism. Yet these benefits are seldom enjoyed in functional programming, because the existing features for non-strictness, sharing, and nondeterminism in functional languages are tricky to combine. We present a practical way to write purely functional lazy non-deterministic programs that are efficient and perspicuous. We achieve this goal by embedding the programs into existing languages (such as Haskell, SML, and OCaml) with high-quality implementations, by making choices lazily and representing data with non-deterministic components, by working with custom monadic data types and search strategies, and by providing equational laws for the programmer to reason about their code.

Original languageEnglish
Pages (from-to)11-22
Number of pages12
JournalACM SIGPLAN Notices
Volume44
Issue number9
DOIs
Publication statusPublished - 2009 Sep
Externally publishedYes

Keywords

  • Call-time choice
  • Continuations
  • Monads
  • Side effects

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Purely Functional Lazy Non-deterministic Programming'. Together they form a unique fingerprint.

Cite this