Haskell-RL: An Equational Specification of Haskell in Maude

From FSL
Jump to: navigation, search

Andrew Bennett
MS CS Thesis Submission
Abstract. This paper serves to culminate work done on specifying a lazy language, Haskell, within a rewriting logic framework such as Maude. The features and capabilites of the resultant language, Haskell-RL, are similar in spirit to the base language Haskell. This writing shall also serve as a manual for the specification we have created. Performance runs of Haskell-RL show that the specification is very powerful, as it can produce similar results to other languages implemented in Maude.
PDF, semantics

Personal tools