A DEFINITE AND UNFOLDABLE, PARTIALLY DETERMINISTIC LANGUAGE

Authors
JACKSON WK BURTON FW
Citation
Wk. Jackson et Fw. Burton, A DEFINITE AND UNFOLDABLE, PARTIALLY DETERMINISTIC LANGUAGE, Computer journal, 37(8), 1994, pp. 711-714
Citations number
6
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
Computer journal → ACNP
ISSN journal
00104620
Volume
37
Issue
8
Year of publication
1994
Pages
711 - 714
Database
ISI
SICI code
0010-4620(1994)37:8<711:ADAUPD>2.0.ZU;2-2
Abstract
We define a simple non-deterministic functional language that has defi nite variables and where function application is unfoldable. This lang uage demonstrates that Sondergaard and Sestoft's claim, that in a non- deterministic language we cannot obtain both definiteness and unfoldab ility, assumes a fairly general notion of non-determinism. Our languag e relies on using a restricted notion of non-determinism called partia l determinism.