Article

Free access

Exact real arithmetic: a case study in higher order programming

Authors:

Hans-J. Boehm,

Robert Cartwright,

Mark Riggle,

Michael J. O'DonnellAuthors Info & Claims

LFP '86: Proceedings of the 1986 ACM conference on LISP and functional programming

Pages 162 - 173

https://doi.org/10.1145/319838.319860

Published: 08 August 1986 Publication History

PDF eReader

References

[1]

Avizienis, A., "Signed-Digit Number Representations for Fast Parallel Arithmetic", Institute of Radio Engineers Transactions on Electronic Computers, 1961, p. 389.

Google Scholar

[2]

Avizienis, A, "Binary-Compatible Signed-Digit Arithmetic", AFIPS Conference Proceedings 26, 1(1964), pp. 66,3-672

Google Scholar

[3]

Atkins, D. E., "Introduction to the Role of Redundancy m Computer Arithmetic, iEEE Computer 8, 6 (1975), pp. 74-76

Google Scholar

[4]

Bishop, Errett, Fosndationz o! Constructive Analyeis, McGraw-Hi!l, New York, 1967.

Google Scholar

[5]

Bridges, D. S., Oonstructive Functional Analysis, Pitman, London, 1979.

Google Scholar

[6]

Boehm, Hans, Alan Demers, and James Donahue, "A Programmer's Introductwn to Russell", Technical Report 85-16, Department of Computer Science, Rice University.

Google Scholar

[7]

Boehm, Hans, and Alan Demers, "Implementing Russell", Techmeal Report 85-25, Department of Computer Soence, Rice University. Was also presented at, the SiGPLAN '86 Compder Construction Conference.

Digital Library

Google Scholar

[8]

Cardelli, Luca, "Compdmg a Functional Language", Conference Record of the 1984 Symposium on LISP and Functional Programruing, pp. 208-217.

Digital Library

Google Scholar

[9]

R. Cartwright, "A Constructive Alternative to Axiomatic Data Type Definitions", Proceedings of 1980 Symposium on LISP and Functional Programming, Stanford University, August 1980, pp. 46-55.

Digital Library

Google Scholar

[10]

R. Cartwright, "Formal Program Testing," Proceedings of the Elshth Annual Symposium on Principles of Programming Languages, Wi!lamsburg, Va, January 1981, pp. 125-132

Digital Library

Google Scholar

[11]

R. Cartwnsht and J. Donahue, "The Semantics of Lazy and Industrious Evaluation," Conference Record of the 1982 ACM Symposium on LISP and Functional Programming, Carnegie- Mellon Umversity, August 1982.

Digital Library

Google Scholar

[12]

Cartwright, Robert S, et al., "Rn: An Expertmental Computer Network to Support Numencal Computatwn", Technical Report, Mathematical Sciences Department, Rice University, 1982.

Google Scholar

[13]

R. Cartwright, "Recursive Programs as Definitions in First Order Logic", SIAM J. Computing, May 1984

Digital Library

Google Scholar

[14]

Demers, Alan, and J. Donahue, "Data Types are Values", ACM Transactwns on Programruing Languages and Systems 7, 3 (July 1985), pp 426-445.

Digital Library

Google Scholar

[15]

Golub, Gene H., and Charles F. Van Loan, Matriz Computations, Johns Hopkins University Press, Baltimore, 1983.

Google Scholar

[16]

Knuth, Donald E., The Art of Computer Programming, Vol. ~, Seminumerical Algorithrr~, Addison Wesley, 1969.

Digital Library

Google Scholar

[17]

Myhill, J., "What is a Real Number?", American Mathematical Monthly 79, 7 (1972), pp. 748-754

Crossref

Google Scholar

[18]

O'Donnell, Michael J., Equational Logic as a Programming La#guage, MIT Press, 1985

Digital Library

Google Scholar

[19]

Owens, R. M. and M. F. Irwin, "On-Line Algorithms for the Design of Pipeline Architeetures", Annual Symposium on Computer Architecture, Philadelphia, 1979, pp 12-19

Digital Library

Google Scholar

[20]

Peyton Jones, Simon L., "Arbitrary Preoslon Arithmetic Using Continued Fractions", INDRA Note 1530, Department of Computer Science, University College London, 1984

Google Scholar

[21]

Rogers, Hartley Jr., Theor~l of Recursive Functions and Effective Oomputabilitlt, McGraw-Hi!l, 1967. See especially p. 371.

Digital Library

Google Scholar

[22]

D Scott, Lectures on a Mathematical Theory of Computation, Technical Monograph PRG-19, Oxford University Computing Laboratory, Oxford, 1981.

Google Scholar

[23]

Wiedmer, E., "Computing with Infinite Objects", Theoretical Computer Science 10 (1980), pp. 133-155

Crossref

Google Scholar

[24]

Wilkmson, J H., The Algebraic Eigenvalu~ Problem, Academic Press, London, 1965

Digital Library

Google Scholar

Cited By

View all

Goubault-Larrecq JJia XThéron C(2023)A Domain-theoretic Approach to Statistical Programming LanguagesJournal of the ACM10.1145/361166070:5(1-63)Online publication date: 11-Oct-2023
https://dl.acm.org/doi/10.1145/3611660
Chowdhary SNagarakatte SSpinellis DGousios GChechik MDi Penta M(2021)Parallel shadow execution to accelerate the debugging of numerical errorsProceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3468264.3468585(615-626)Online publication date: 20-Aug-2021
https://dl.acm.org/doi/10.1145/3468264.3468585
Boehm HDonaldson ATorlak E(2020)Towards an API for the real numbersProceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3385412.3386037(562-576)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3385412.3386037
Show More Cited By

Recommendations

Higher order probabilities
UAI'87: Proceedings of the Third Conference on Uncertainty in Artificial Intelligence

A number of writers have supposed that for the full specification of belief, higher order probabilities are required. Some have even supposed that there may be an unending sequence of higher order probabilities of probabilities of probabilities. ... In ...
Higher order Programming in Java: Introspection, Subsumption and Extraction
Concurrency Specification and Programming (CS&P 2004)

Higher order programming is considered a good methodology for program design and specification, furthermore it is fundamental for rapid prototyping. The paper is devoted to higher order programming in Java and, more in general, in the OO programming ...
Higher order Programming in Java: Introspection, Subsumption and Extraction
Concurrency Specification and Programming (CS&P 2004)

Higher order programming is considered a good methodology for program design and specification, furthermore it is fundamental for rapid prototyping. The paper is devoted to higher order programming in Java and, more in general, in the OO programming ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

LFP '86: Proceedings of the 1986 ACM conference on LISP and functional programming

August 1986

372 pages

ISBN:0897912004

DOI:10.1145/319838

Chairmen:
William L. Scherlis
Carnegie Mellon Univ., Pittsburgh, PA
,
John H. Williams
IBM Research, San Jose, CA
,
Richard P. Gabriel
Lucid Inc., Meulo Park, CA

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: 08 August 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
951
Total Downloads

Downloads (Last 12 months)98
Downloads (Last 6 weeks)22

Reflects downloads up to 16 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Goubault-Larrecq JJia XThéron C(2023)A Domain-theoretic Approach to Statistical Programming LanguagesJournal of the ACM10.1145/361166070:5(1-63)Online publication date: 11-Oct-2023
https://dl.acm.org/doi/10.1145/3611660
Chowdhary SNagarakatte SSpinellis DGousios GChechik MDi Penta M(2021)Parallel shadow execution to accelerate the debugging of numerical errorsProceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3468264.3468585(615-626)Online publication date: 20-Aug-2021
https://dl.acm.org/doi/10.1145/3468264.3468585
Boehm HDonaldson ATorlak E(2020)Towards an API for the real numbersProceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3385412.3386037(562-576)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3385412.3386037
Kawamura ASteinberg FThies H(2018)Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE SolvingLogic, Language, Information, and Computation10.1007/978-3-662-57669-4_13(223-236)Online publication date: 27-Jun-2018
https://doi.org/10.1007/978-3-662-57669-4_13
Kawabata H(2017)Speeding up Exact Real Arithmetic on Fast Binary Cauchy Sequences by Using Memoization Based on Quantized PrecisionJournal of Information Processing10.2197/ipsjjip.25.49425(494-504)Online publication date: 2017
https://doi.org/10.2197/ipsjjip.25.494
Tucker JZucker J(2017)Infinitary initial algebra specifications for stream algebrasReflections on the Foundations of Mathematics10.1017/9781316755983.012(228-248)Online publication date: 31-Mar-2017
https://doi.org/10.1017/9781316755983.012
Kawabata HIwasaki H(2016)Improving Floating-Point NumbersProceedings of the 25th European Symposium on Programming Languages and Systems - Volume 963210.5555/3089528.3089544(390-418)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.5555/3089528.3089544
Small PKalia RNakano AVashishta P(2016)Order-Invariant Real Number Summation: Circumventing Accuracy Loss for Multimillion Summands on Multiple Parallel Architectures2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2016.41(152-160)Online publication date: May-2016
https://doi.org/10.1109/IPDPS.2016.41
Kawabata HIwasaki H(2016)Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical ComputationsProgramming Languages and Systems10.1007/978-3-662-49498-1_16(390-418)Online publication date: 2016
https://doi.org/10.1007/978-3-662-49498-1_16
Neron PChitil OKing ADanvy O(2014)Elimination of Square Roots and Divisions by Partial InliningProceedings of the 16th International Symposium on Principles and Practice of Declarative Programming10.1145/2643135.2643140(81-92)Online publication date: 8-Sep-2014
https://dl.acm.org/doi/10.1145/2643135.2643140
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

Recommendations

Higher order probabilities

Higher order Programming in Java: Introspection, Subsumption and Extraction

Higher order Programming in Java: Introspection, Subsumption and Extraction