Pattern-driven Reduction in Haskell. Harrison, W. & Kieburtz, R. In 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02), Copenhagen, Denmark, 2002.
Paper abstract bibtex Haskell is a functional programming language with nominally non-strict semantics, implying that evaluation of a Haskell expression proceeds by demand-driven reduction. However, Haskell also provides pattern matching on arguments of functions, in \bf let expressions and in the match clauses of \bf case expressions. Pattern-matching requires data-driven reduction to the extent necessary to evaluate a pattern match or to bind variables introduced in a pattern. In this paper we provide both an abstract semantics and a logical characterization of pattern-matching in Haskell and the reduction order that it entails.
@InProceedings{HK02,
author = "William Harrison and Richard Kieburtz",
title = "Pattern-driven Reduction in Haskell",
booktitle = "2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)",
address = "Copenhagen, Denmark",
year = "2002",
hconf = "yes",
url_Paper = "https://harrisonwl.github.io/assets/papers/wrs02.pdf",
abstract = "Haskell is a functional programming language with nominally non-strict
semantics, implying that evaluation of a Haskell expression proceeds by
demand-driven reduction. However, Haskell also provides pattern
matching
on arguments of functions, in {\bf let} expressions and in the match
clauses of {\bf case} expressions. Pattern-matching requires
data-driven reduction to the extent necessary to
evaluate a pattern match or to bind variables introduced in a pattern.
In this paper we
provide both an abstract semantics and a logical characterization of
pattern-matching in Haskell and the reduction order that it entails.",
}
Downloads: 0
{"_id":"kS6RawF8QnAB6CfJm","bibbaseid":"harrison-kieburtz-patterndrivenreductioninhaskell-2002","downloads":0,"creationDate":"2016-07-28T19:31:33.211Z","title":"Pattern-driven Reduction in Haskell","author_short":["Harrison, W.","Kieburtz, R."],"year":2002,"bibtype":"inproceedings","biburl":"https://harrisonwl.github.io/assets/bibliography/harrison.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["William"],"propositions":[],"lastnames":["Harrison"],"suffixes":[]},{"firstnames":["Richard"],"propositions":[],"lastnames":["Kieburtz"],"suffixes":[]}],"title":"Pattern-driven Reduction in Haskell","booktitle":"2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)","address":"Copenhagen, Denmark","year":"2002","hconf":"yes","url_paper":"https://harrisonwl.github.io/assets/papers/wrs02.pdf","abstract":"Haskell is a functional programming language with nominally non-strict semantics, implying that evaluation of a Haskell expression proceeds by demand-driven reduction. However, Haskell also provides pattern matching on arguments of functions, in \\bf let expressions and in the match clauses of \\bf case expressions. Pattern-matching requires data-driven reduction to the extent necessary to evaluate a pattern match or to bind variables introduced in a pattern. In this paper we provide both an abstract semantics and a logical characterization of pattern-matching in Haskell and the reduction order that it entails.","bibtex":"@InProceedings{HK02,\n author = \"William Harrison and Richard Kieburtz\",\n title = \"Pattern-driven Reduction in Haskell\",\n booktitle = \"2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS02)\",\n address = \"Copenhagen, Denmark\",\n year = \"2002\",\n hconf = \"yes\",\n url_Paper = \"https://harrisonwl.github.io/assets/papers/wrs02.pdf\",\n abstract = \"Haskell is a functional programming language with nominally non-strict\nsemantics, implying that evaluation of a Haskell expression proceeds by\ndemand-driven reduction. However, Haskell also provides pattern \nmatching\non arguments of functions, in {\\bf let} expressions and in the match\nclauses of {\\bf case} expressions. Pattern-matching requires\ndata-driven reduction to the extent necessary to\nevaluate a pattern match or to bind variables introduced in a pattern.\nIn this paper we\nprovide both an abstract semantics and a logical characterization of\npattern-matching in Haskell and the reduction order that it entails.\",\n}\n\n\n\n","author_short":["Harrison, W.","Kieburtz, R."],"key":"HK02","id":"HK02","bibbaseid":"harrison-kieburtz-patterndrivenreductioninhaskell-2002","role":"author","urls":{" paper":"https://harrisonwl.github.io/assets/papers/wrs02.pdf"},"metadata":{"authorlinks":{"harrison, w":"https://harrisonwl.github.io/etc/publications.html"}},"downloads":0},"search_terms":["pattern","driven","reduction","haskell","harrison","kieburtz"],"keywords":[],"authorIDs":["5dc475579b60c2df010000fb","5dee581feaaee4df01000254","5df9dbe338a7afde010000b8","5e03c9676d2066de01000013","5e2b8df4f92538df01000009","5e55f36cc2c8a2df010000f1","5e64fd0d5fc0b7de010000d4","BPp6pLGb3wvE8tPNi","GrcodozaBpTrw2nXH","NmXf49aeDyLF3AL8F","a66s2jJ42S97qQxnX","iCiuqX2A39oLpzRv9","njB2ZmsnMejPsL7oC","uBWQddfiBuSzTqKrJ","xkL56M792TvXx8Hef"],"dataSources":["wAeScLDKnpPTHdYwg","uCveoExKMHQNZnZCp"]}