A Definite and Unfoldable, Partially Deterministic Language | Zendy

W. Ken Jackson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Definite and Unfoldable, Partially Deterministic Language

Author(s) -

W. Ken Jackson

Publication year - 1994

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/37.8.711

Subject(s) - determinism , definiteness , simple (philosophy) , computer science , function (biology) , positive definiteness , positive definite matrix , mathematics , linguistics , philosophy , epistemology , physics , eigenvalues and eigenvectors , quantum mechanics , evolutionary biology , biology

We define a simple non-deterministic functional language that has definite variables and where function application is unfoldable. This language demonstrates that Sondergaard and Sestoft's claim, that in a non-deterministic language we cannot obtain both definiteness and unfoldability, assumes a fairly general notion of non-determinism. Our language relies on using a restricted notion of non-determinism called partial determinism

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research