Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)

E-resources

PDF

Full text

Open access

Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)

Lassen, Søren B.; Pitcher, Corin S.

Electronic notes in theoretical computer science, 1998, 1998-00-00, Volume: 10

Journal Article

This paper investigates operationally-based theories of a simply-typed functional programming language with countable non-determinism. The theories are based upon lower, upper, and convex variants of applicative similarity and bisimilarity, and the main result presented here is that these relations are compatible. The differences between the relations are illustrated by simple examples, and their continuity properties are discussed. It is also shown that, in some cases, the addition of countable non-determinism to a programming language with finite non-determinism alters the theory of the language.

Keep searching

Author

Lassen, Søren B. | Pitcher, Corin S.

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme