Article

A reduction semantics for imperative higher-order languages

Authors:

M Felleisen,

D P FriedmanAuthors Info & Claims

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe

Pages 206 - 223

Published: 01 March 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Kameyama YKiselyov OShan CPuebla GVidal G(2009)Shifting the stageProceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1480945.1480962(111-120)Online publication date: 19-Jan-2009
https://dl.acm.org/doi/10.1145/1480945.1480962
Dyvbig RPeyton Jones SSabry A(2007)A monadic framework for delimited continuationsJournal of Functional Programming10.1017/S095679680700625917:6(687-730)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1017/S0956796807006259
Queinnec C(1993)A library of high level control operatorsACM SIGPLAN Lisp Pointers10.1145/181889.181891VI:4(11-26)Online publication date: 1-Oct-1993
https://dl.acm.org/doi/10.1145/181889.181891
Show More Cited By

Index Terms

A reduction semantics for imperative higher-order languages

Recommendations

Definitional Interpreters for Higher-Order Programming Languages

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Definitional interpreters for higher-order programming languages
ACM '72: Proceedings of the ACM annual conference - Volume 2

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Pilsner: a compositionally verified compiler for a higher-order imperative language
ICFP '15

Compiler verification is essential for the construction of fully verified software, but most prior work (such as CompCert) has focused on verifying whole-program compilers. To support separate compilation and to enable linking of results from different ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe

March 1987

463 pages

ISBN:0387179453

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kameyama YKiselyov OShan CPuebla GVidal G(2009)Shifting the stageProceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1480945.1480962(111-120)Online publication date: 19-Jan-2009
https://dl.acm.org/doi/10.1145/1480945.1480962
Dyvbig RPeyton Jones SSabry A(2007)A monadic framework for delimited continuationsJournal of Functional Programming10.1017/S095679680700625917:6(687-730)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1017/S0956796807006259
Queinnec C(1993)A library of high level control operatorsACM SIGPLAN Lisp Pointers10.1145/181889.181891VI:4(11-26)Online publication date: 1-Oct-1993
https://dl.acm.org/doi/10.1145/181889.181891
Moreau LRibbens DWilliams J(1993)Sound rules for parallel evaluation of a functional language callccProceedings of the conference on Functional programming languages and computer architecture10.1145/165180.165197(125-135)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/165180.165197
Sitaram DFelleisen MWise D(1991)Models of continuations without continuationsProceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/99583.99611(185-196)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/99583.99611
Abelson HDybvig RHaynes CRozas GAdams NFriedman DKohlbecker ESteele GBartley DHalstead ROxley DSussman GBrooks GHanson CPitman KWand M(1991)Revised4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers10.1145/382130.382133IV:3(1-55)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/382130.382133
Felleisen MChailloux J(1988)λ-V-CS: an extended λ-calculus for schemeProceedings of the 1988 ACM conference on LISP and functional programming10.1145/62678.62686(72-85)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62678.62686
Yigit O(1988)Readings in schemeACM SIGPLAN Lisp Pointers10.1145/1317232.13172402:1(56-61)Online publication date: 1-Jul-1988
https://dl.acm.org/doi/10.1145/1317232.1317240

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Definitional Interpreters for Higher-Order Programming Languages

Definitional interpreters for higher-order programming languages

Pilsner: a compositionally verified compiler for a higher-order imperative language

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations