invited-talk

A walk in the semantic park

Authors:

Jacob Johannsen,

Ian ZernyAuthors Info & Claims

PEPM '11: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation

Pages 1 - 12

https://doi.org/10.1145/1929501.1929503

Published: 24 January 2011 Publication History

Abstract

To celebrate the 20th anniversary of PEPM, we are inviting you to a walk in the semantic park and to inter-derive reduction-based and reduction-free negational normalization functions.

References

[1]

M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard. A functional correspondence between evaluators and abstract machines. In D. Miller, editor, Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming(PPDP'03), pages 8--19, Uppsala, Sweden, Aug. 2003.

Digital Library

[2]

M. Biernacka and O. Danvy. Asyntactic correspondence between context sensitive calculi and abstract machines. Theoretical Computer Science, 375(1--3):76--108, 2007. Extended version available as the research report BRICSRS-06-18.

Digital Library

[3]

O. Danvy. From reduction-based to reduction-free normalization. In P. Koopman, R. Plasmeijer, and D. Swierstra, editors, Advanced Functional Programming, Sixth International School, number 5382 in Lecture Notes in Computer Science, pages 66--164, Nijmegen, The Netherlands, May 2008. Springer. Lecture note sincluding 70+ exercises.

Digital Library

[4]

O. Danvy. Back to direct style. Science of Computer Programming, 22(3):183--195, 1994. A preliminary version was presented at the Fourth European Symposium on Programming(ESOP1992).

Digital Library

[5]

O. Danvy and J. Johannsen. Inter-deriving semantic artifacts for object-oriented programming. Journal of Computer and System Sciences, 76:302--323, 2010.

Digital Library

[6]

O. Danvy and K. Millikin. On the equivalence between small-step and big-step abstract machines: a simple application of light weight fusion. Information Processing Letters, 106(3):100--109, 2008.

Digital Library

[7]

O. Danvy and K. Millikin. Refunctionalization at work. Science of Computer Programming, 74(8):534--549, 2009. Extended version available as there search report BRICSRS-08-04.

Digital Library

[8]

O. Danvy and L. R. Nielsen. Defunctionalization at work. In H. Søndergaard, editor, Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming(PPDP'01), pages 162--174, Firenze, Italy, Sept. 2001. Extended version available as there search report BRICSRS-01-23.

Digital Library

[9]

O. Danvy and L. R. Nielsen. Refocusing in reduction semantics. Research Report BRICSRS-04-26, Department of Computer Science, Aarhus University, Aarhus, Denmark, Nov. 2004. A preliminary version appeared in the informal proceedings of the Second International Workshop on Rule-Based Programming(RULE2001), Electronic Notes in Theoretical Computer Science, Vol. 59.4.

[10]

M. Felleisen. The Calculi of-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Computer Science Department, Indiana University, Bloomington, Indiana, Aug. 1987.

Digital Library

[11]

S. E. Ganz, D. P. Friedman, and M. Wand. Trampolined style. In P. Lee, editor, Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, SIGPLAN Notices, Vol. 34, No. 9, pages 18--27, Paris, France, Sept. 1999.

Digital Library

[12]

A. Ohori and I. Sasano. Lightweight fusion by fixed point promotion. In M. Felleisen, editor, Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages, SIGPLAN Notices, Vol. 42, No. 1, pages 143--154, Nice, France, Jan. 2007.

Digital Library

[13]

G. D. Plotkin.Theorigins of structural operational semantics. Journal of Logic and Algebraic Programming, 60--61: 3--15, 2004.

[14]

G. D. Plotkin. Call-by-name, call-by-value and the-calculus. Theoretical Computer Science, 1: 125--159, 1975.

[15]

G. D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, Department of Computer Science, Aarhus Unversity, Aarhus, Denmark, Sept. 1981. Reprinted in the Journal of Logic and Algebraic Programming 60--61: 17--139, 2004, with a foreword{13}.

[16]

J. C. Reynolds. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference, pages 717--740, Boston, Massachusetts, 1972. Reprinted in Higher-Order and Symbolic Computation 11(4):363--397, 1998, with a foreword {17}.

Digital Library

[17]

J. C. Reynolds. Definitional interpreters revisited. Higher-Order and Symbolic Computation, 11(4):355--361,1998.

Digital Library

Cited By

Ambal GLenglet SSchmitt ANoûS C(2022)Certified Derivation of Small-Step From Big-Step Skeletal SemanticsProceedings of the 24th International Symposium on Principles and Practice of Declarative Programming10.1145/3551357.3551384(1-48)Online publication date: 20-Sep-2022
https://dl.acm.org/doi/10.1145/3551357.3551384
Binder DJabs JSkupin IOstermann K(2019)Decomposition diversity with symmetric data and codataProceedings of the ACM on Programming Languages10.1145/33710984:POPL(1-28)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371098
GARCÍA-PÉREZ ÁNOGUEIRA P(2019)The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculusJournal of Functional Programming10.1017/S095679681900001729Online publication date: 29-Apr-2019
https://doi.org/10.1017/S0956796819000017
Show More Cited By

Index Terms

A walk in the semantic park

Recommendations

A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers
PEPM '13: Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation

Olivier Danvy and others have shown the syntactic correspondence between reduction semantics (a small-step semantics) and abstract machines, as well as the functional correspondence between reduction-free normalisers (a big-step semantics) and abstract ...
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order
PPDP '13: Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

We derive by program transformation Pierre Crégut's full-reducing Krivine machine KN from the structural operational semantics of the normal order reduction strategy in a closure-converted pure lambda calculus. We thus establish the correspondence ...
Three syntactic theories for combinatory graph reduction

We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this first syntactic theory as a storeless reduction ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PEPM '11: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation

January 2011

72 pages

ISBN:9781450304856

DOI:10.1145/1929501

Program Chairs:
Siau-Cheng Khoo
National University of Singapore, Singapore
,
Jeremy Siek
University of Colorado at Boulder, USA

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 January 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Invited-talk

Conference

POPL '11

Sponsor:

SIGPLAN

POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 24 - 25, 2011

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
244
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)3

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ambal GLenglet SSchmitt ANoûS C(2022)Certified Derivation of Small-Step From Big-Step Skeletal SemanticsProceedings of the 24th International Symposium on Principles and Practice of Declarative Programming10.1145/3551357.3551384(1-48)Online publication date: 20-Sep-2022
https://dl.acm.org/doi/10.1145/3551357.3551384
Binder DJabs JSkupin IOstermann K(2019)Decomposition diversity with symmetric data and codataProceedings of the ACM on Programming Languages10.1145/33710984:POPL(1-28)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371098
GARCÍA-PÉREZ ÁNOGUEIRA P(2019)The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculusJournal of Functional Programming10.1017/S095679681900001729Online publication date: 29-Apr-2019
https://doi.org/10.1017/S0956796819000017
Vesely FFisher K(2019)One Step at a TimeProgramming Languages and Systems10.1007/978-3-030-17184-1_8(205-231)Online publication date: 6-Apr-2019
https://doi.org/10.1007/978-3-030-17184-1_8
Ostermann KJabs J(2018)Dualizing Generalized Algebraic Data Types by Matrix TranspositionProgramming Languages and Systems10.1007/978-3-319-89884-1_3(60-85)Online publication date: 14-Apr-2018
https://doi.org/10.1007/978-3-319-89884-1_3
García-Pérez ÁNogueira PSergey IChin WHage J(2014)Deriving interpretations of the gradually-typed lambda calculusProceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation10.1145/2543728.2543742(157-168)Online publication date: 11-Jan-2014
https://dl.acm.org/doi/10.1145/2543728.2543742
Danvy OJohannsen J(2014)From Outermost Reduction Semantics to Abstract MachineLogic-Based Program Synthesis and Transformation10.1007/978-3-319-14125-1_6(91-108)Online publication date: 11-Dec-2014
https://doi.org/10.1007/978-3-319-14125-1_6
Simmons RZerny IPeña RSchrijvers T(2013)A logical correspondence between natural semantics and abstract machinesProceedings of the 15th Symposium on Principles and Practice of Declarative Programming10.1145/2505879.2505899(109-119)Online publication date: 16-Sep-2013
https://dl.acm.org/doi/10.1145/2505879.2505899
García-Pérez ÁNogueira PMoreno-Navarro JPeña RSchrijvers T(2013)Deriving the full-reducing Krivine machine from the small-step operational semantics of normal orderProceedings of the 15th Symposium on Principles and Practice of Declarative Programming10.1145/2505879.2505887(85-96)Online publication date: 16-Sep-2013
https://dl.acm.org/doi/10.1145/2505879.2505887
García-Pérez ÁNogueira PAlbert EMu S(2013)A syntactic and functional correspondence between reduction semantics and reduction-free full normalisersProceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation10.1145/2426890.2426911(107-116)Online publication date: 21-Jan-2013
https://dl.acm.org/doi/10.1145/2426890.2426911
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten