Towards an Operational Semantics for a Parallel Non-strict Functional Language

Hall, Jon G.; Baker-Finch, Clement A.; Trinder, Phil; King, David

doi:10.1007/3-540-48515-5_4

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So far, most of this reasoning has been done informally. However, we are currently working on an operational semantics for GPH, in order to prove identities about strategies [89]. The strategic identities can then be used to prove equalities and inequalities between strategic functions.…”

Section: Future Workmentioning

confidence: 99%

Engineering parallel symbolic programs in GPH

Loidl

Trinder

Hammond

et al. 1999

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

Section: Future Workmentioning

confidence: 99%

Engineering parallel symbolic programs in GPH

Loidl

Trinder

Hammond

et al. 1999

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

“…Several systems have been derived from Launchbury's, but none that we know of leaves the choice of redex free. Derived systems of interest are [4], which defines an operational semantics specifically for Clean, and [12], which defines a single-step reduction system for parallel evaluation. Both systems fix a single redex, however, and are therefore less suited for formal reasoning.…”

Section: Related Workmentioning

confidence: 99%

A Single-Step Term-Graph Reduction System for Proof Assistants

Mol

Eekelen

Plasmeijer

2008

Applications of Graph Transformations With Industrial Relevance

View full text Add to dashboard Cite

Abstract. In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplished by leaving the choice of redex free and by making use of single-step reduction. It is therefore more suited for formal reasoning than the well-established standard reduction systems, which usually fix a single redex and realize multi-step reduction only. We will show that our custom system is correct with respect to the standard systems, by proving that it is confluent and allows standard lazy functional evaluation as a possible reduction path. Our reduction system is used in the foundation of Sparkle. Sparkle is the dedicated proof assistant for Clean, a lazy functional programming language based on term-graph rewriting. An important reasoning step in Sparkle is the replacement of an expression with one of its reducts. The flexibility of our underlying reduction mechanism ensures that as many reduction options as possible are available for this reasoning step, which improves the ease of reasoning. Because our reduction system is based on a simplified lazy functional language, our results can be applied to any other functional language based on term-graph rewriting as well.

show abstract