Article

Free access

Separating binding times in language specifications

Author:

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

Pages 12 - 25

https://doi.org/10.1145/99370.99372

Published: 01 November 1989 Publication History

PDF eReader

References

[1]

A. Bondorf, N. D. Jones, T. }E. Mogensen, P. Sestoft, Self-application as a Tool for the Generation of Program Generators. To be published.

Google Scholar

[2]

J. Hughes, Backwards Analysis of FunctionaI Programs, Workshop on Partial Evaluation and Mixed Computation, Gl. A vernres, Denmark, Oc~tober 1987 (eds. D. BjOrner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 187-208

Google Scholar

[3]

N. D. Jones, Automatic Program Specialization: A Re-examination from Basic Principles, Workshop on Partial Evaluation and Mixed Cornputalion, GI. A vernees, Denmark, October 1987 (eds. D. BjCrner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 225-282

Google Scholar

[4]

N. D. Jones, P. Sestoft and It. SOndergaard, An Experiment in Partial Evaluation: The Generation of a Compiler Generator, ~ewriting Techniques and Applications (ed. J.-P. Jouannaud), Lecture Notes in Computer Science 202, Springer-Verlag 1985, pp. 124- 140

Digital Library

Google Scholar

[5]

N. D. Jones, P. Sestoft and It. SCndergaard, Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Compuiation 2,1 (1989), pp. 9-50

Google Scholar

[6]

U. J~rring and W. L. Sherlis, Compilers and Staging Transformations, Proc. Thirteenth A CM POPL Syrup., St. Petersburg, Florida 1986, pp. 86-96

Digital Library

Google Scholar

[7]

J. Launchbury, Projections for Specialisation, Workshop on Partial Evaluation and Mixed Computaiion, Gi. A verncrs, Denmark, October 1987 (eds. D. Bjorner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 299-315

Google Scholar

[8]

T. ~. Mogensen, Partially Static Structures in a Self-Applicable Partial }}valuator, Workshop on Partial Evaluation and Mixed Computation, GI. A vernces, Denmark, October 1987 (eds. D. Bj0rner, A. P. Ershov and N. D. Jones), North- Ilolland 1988, pp. 325-347

Google Scholar

[9]

T. ~. Mogensen, Binding Time Analysis of a Polymorphically Typed Higher-Order Language, Proceedings of TAPSOFT '89, vol. 2, Lecture Notes in Computer Science 352, Springer- Verlag 1989. pp. 298-312

Digital Library

Google Scholar

[10]

H. R. Nielson and F Nielson, Automatic Binding Time Analysis for a Typed A -calculus, Science of Computer Programming 10, 2 (April 1988), North-Holland 1988, pp. 139-176.

Digital Library

Google Scholar

[11]

S. A. Romanenko, A Compiler Generator Produced by a Self-Applicable Specializer Can tiave a Surprisingly Natural and Understandable Structure, Workshop on Partial Evaluation and illized Computation, GI. Avernaxs, Denmark. October 1987 (eds. D. BjOrner, A. P. Ershov and N. D. Jones), North-Holland 1988, pp. 445-463

Google Scholar

[12]

P. Sestoft, The Structure of a Self-Applicable Partial Evaluator, Programs as Data Objects, Cope,- hagen, Denmark, 1985 (eds. H. Ganzinger and N. D. Jones) Lecture Noles in Computer Science 217, Springer-Verlag 1986, pp. 236-256

Digital Library

Google Scholar

Cited By

View all

Chen YGuo ZLi RChen SZhou LZhou YZhang X(2021)ForerunnerProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483564(570-587)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3477132.3483564
Feltman NAngiuli CAcar UFatahalian K(2016)Automatically Splitting a Two-Stage Lambda CalculusProceedings of the 25th European Symposium on Programming Languages and Systems - Volume 963210.1007/978-3-662-49498-1_11(255-281)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49498-1_11
Consel CDanvy O(2005)For a better support of static data flowFunctional Programming Languages and Computer Architecture10.1007/3540543961_24(496-519)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_24
Show More Cited By

Index Terms

Separating binding times in language specifications
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
2. Theory of computation
  1. Logic
  2. Semantics and reasoning
    1. Program constructs
    2. Program reasoning

Recommendations

Formalized structured analysis specifications
Debugging Larch Shared Language Specifications

The checkability designed into the LSL (Larch shared language) is described, and two tools that help perform the checking are discussed. LP (the Larch power) is the principal debugging tool. Its design and development have been motivated primarily by ...
Writing Larch interface language specifications

Current research in specifications is emphasizing the practical use of formal specifications in program design. One way to encourage their use in practice is to provide specification languages that are accessible to both designers and programmers. With ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

November 1989

395 pages

ISBN:0897913280

DOI:10.1145/99370

Chairman:
Joseph E. Stoy

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA89

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA89: The International Conference on Functional Programming Languages & Computer Architectures

September 11 - 13, 1989

Imperial College, London, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)1

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen YGuo ZLi RChen SZhou LZhou YZhang X(2021)ForerunnerProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483564(570-587)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3477132.3483564
Feltman NAngiuli CAcar UFatahalian K(2016)Automatically Splitting a Two-Stage Lambda CalculusProceedings of the 25th European Symposium on Programming Languages and Systems - Volume 963210.1007/978-3-662-49498-1_11(255-281)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49498-1_11
Consel CDanvy O(2005)For a better support of static data flowFunctional Programming Languages and Computer Architecture10.1007/3540543961_24(496-519)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_24
Thiemann PSperber M(2005)Polyvariant expansion and compiler generatorsPerspectives of System Informatics10.1007/3-540-62064-8_24(285-296)Online publication date: 3-Jun-2005
https://doi.org/10.1007/3-540-62064-8_24
Thiemann P(2005)Implementing memoization for partial evaluationProgramming Languages: Implementations, Logics, and Programs10.1007/3-540-61756-6_86(198-212)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61756-6_86
Mogensen T(2005)Evolution of partial evaluators: Removing inherited limitsPartial Evaluation10.1007/3-540-61580-6_15(303-321)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61580-6_15
Nielson HNielson F(2005)Eureka definitions for free! or Disagreement points for fold/unfold transformationsESOP '9010.1007/3-540-52592-0_70(291-305)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-52592-0_70
Glück R(2004)The Translation Power of the Futamura ProjectionsPerspectives of System Informatics10.1007/978-3-540-39866-0_16(133-147)Online publication date: 2004
https://doi.org/10.1007/978-3-540-39866-0_16
Leuschel MCraig SBruynooghe MVanhoof W(2004)Specialising Interpreters Using Offline Partial DeductionProgram Development in Computational Logic10.1007/978-3-540-25951-0_11(340-375)Online publication date: 2004
https://doi.org/10.1007/978-3-540-25951-0_11
Danvy O(2003)A new one-pass transformation into monadic normal formProceedings of the 12th international conference on Compiler construction10.5555/1765931.1765939(77-89)Online publication date: 7-Apr-2003
https://dl.acm.org/doi/10.5555/1765931.1765939
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Formalized structured analysis specifications

Debugging Larch Shared Language Specifications

Writing Larch interface language specifications