Cited By
View all- Toyn ICattrall DMcDermid JJacob J(1998)A practical language and toolkit for high-integrity toolsJournal of Systems and Software10.1016/S0164-1212(97)10017-641:3(161-173)Online publication date: 1-Jun-1998
Widening the representation bottleneck: a functional implementation of relational programming
Pages 191 - 200
References
[1]
J. Backus. Can programming be liberated from the Von Neumann style? a functional style and its algebra of programs. Communications of the A CM, 21(9):613 - 641, August 1978.
[2]
J. Brown and S. Mitton. Relational programming: Design and implementation of a prototype interpreter. Master's thesis, Naval Postgraduate School, Monterey, California, June 1985.
[3]
A. Bundy and B. Welham. Using meta-level inference for selective application of rewrite rule sets in algebraic manipulation. Artificial Intelligence, 16:189- 212, 1981.
[4]
J. Cai, Ph. Facon, F. Henglein, R. Paige, and E. Schonberg. Type analysis and data structure selection. In B. MSller, editor, Constructing Programs from Specifications. North-Holland, 1991.
[5]
L. Cardelli. Basic polymorphic type checking. Science of Computer Programming, 8(2), 1987.
[6]
D.M. Cattrall. The design and implementation of a relational programming system. D.Phil. thesis YCST 93/01, Department of Computer Science, University of York, England, January 1993.
[7]
D.M. Cattrall and C. Runciman. A relational protramming system with inferred representations. In M. Bruynooghe and M. Wirsing, editors, ~th international Symposium, Programming Language implementation and Logic Programming, Leuven, Belgium, pages 475-476. Springer-Verlag, August 1992. LNCS 631.
[8]
Jon Fairbairn. Making form follow function: An exercise in functional programming style. Software ~ Practice and Experience~ 17(6):379 - 386, June 1987.
[9]
Hudak, Wadler Peyton Jones, Fairbaim Boutel, Guzman Fasel, Hughes Hammond, Kieburtz Johnsson, Partain Nikhil, and Peterson. Report on the programming lanuguage haskell a non-strict, purely functional language version 1.2. ACM $IGPLAN Notices, 27(5):Section R, May 1992.
[10]
P. Hudak. Conception, evolution, and application of functional programming languages. A CM Computing Surveys, 21(3), September 1989.
[11]
G. Jones and M. Sheeran. Circuit design in Ruby. In J. Staunstrup, editor, Formal Methods for VLSI Design. North-Holland, 1990.
[12]
R. Legrand. Extending functional programming towards relations. In H. Ganzinger, editor, European Symposium On Programming '88, pages 206- 220. Springer-Verlag, 1988. LNCS 300.
[13]
J.R. Low. Automatic data structure selection: An example and overview. Communications of the A GM, 21(S):376- 385, May 1978.
[14]
B. MacLerman. Introduction to relational programming. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pages 213- 220. ACM Press, 1981.
[15]
B. MacLennan. Overview of relational programming. A GM SIGPLAN Notices, 18(3):36- 45, March 1983.
[16]
B. MacLennan. Relational programming. Technical Report NPS52-83-012, Naval Postgraduate School, Monterey, California, September 1983.
[17]
B. MacLennan. Four relational programs. A CM SIC- PLAN Notices, 23(1):109- 119, January 1988.
[18]
R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348-375, 1978.
[19]
B. M511er. Join algebra. Papers of the 42nd meeting of I.F.I.P. Working Group 2.1, January 1991.
[20]
L. Rossen. Proving (facts about) Ruby. In Proceedings of the IVth Banff Higher Order Workshop, November 15 1990.
[21]
L. Rossen. Ruby algebra. In G.Jones and M.Sheeran, editors, Workshop on Designing Correct Circuits. Springer-Verlag, 1990.
[22]
E. Schonberg and J.T. Schwartz. An automatic technique for selection of data representations in SETL programs. A CM TOPLAS, 3(2):126- 143, April 1981.
[23]
J.T. Schwartz. Automatic data structure choice in a language of very high level. Communications of the ACM, 18(12), December 1975.
[24]
M. Sheeran. Describing butterfly networks in Ruby. In K. Davis and J. Hughes, editors, Proceedings of the 1989 Glasgow Functional Programming Workshop, pages 182 - 205. Springer-Verlag, 1990.
[25]
P. Wadler. How to replace failure by a list of successes. Proccedings of Functional Programming Languages and Computer Architecture, pages 113-128, September 1985. LNCS 201.
[26]
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proceedings of the 16th Annual A CM Symposium on the Principles of Programming Languages, pages 60 - 76, January 1989.
Index Terms
- Widening the representation bottleneck: a functional implementation of relational programming
Recommendations
Divide and conquer frontend bottleneck
ISCA '20: Proceedings of the ACM/IEEE 47th Annual International Symposium on Computer ArchitectureThe frontend stalls caused by instruction and BTB misses are a significant source of performance degradation in server processors. Prefetchers are commonly employed to mitigate frontend bottleneck. However, next-line prefetchers, which are available in ...
Representation Inheritance: A Safe Form of "White Box'' Code Inheritance
ICSR '96: Proceedings of the 4th International Conference on Software ReuseThere are two approaches to using code inheritance for defining new component implementations in terms of existing implementations. Black box code inheritance allows subclasses to reuse superclass implementations as-is, without direct access to their ...
Cache Design for Eliminating the Address Translation Bottleneck and Reducing the Tag Area Cost
ICCD '02: Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD'02)For the physical caches, the address translation delay can be partially masked, but it is hard to avoid completely. In this paper, we propose a cache partition architecture, called paged cache, which can not only mask the address translation delay ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1993 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
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 1993
Check for updates
Qualifiers
- Article
Conference
FPCA93: Conference on Functional Programming Languages & Computer Architecture
June 9 - 11, 1993
Copenhagen, Denmark
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 259Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)2
Reflects downloads up to 01 Oct 2024
Other Metrics
Citations
Cited By
View all- Toyn ICattrall DMcDermid JJacob J(1998)A practical language and toolkit for high-integrity toolsJournal of Systems and Software10.1016/S0164-1212(97)10017-641:3(161-173)Online publication date: 1-Jun-1998
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.
Sign in