Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. FPCA 1981: Wentworth, New Hampshire, USA
- Arvind, Jack B. Dennis:
Proceedings of the 1981 conference on Functional programming languages and computer architecture, FPCA 1981, Wentworth, New Hampshire, USA, October 1981. ACM 1981, ISBN 0-89791-060-5 - John W. Backus:
Function level programs as mathematical objects. 1-10 - John V. Guttag, James J. Horning, John Williams:
FP with data abstraction and strong typing. 11-24 - Philip Wadler:
Applicative style programming, program transformation, and list operators. 25-32 - Noorul Islam, Thomas J. Myers, Paul Broome:
A simple optimizer for FP-like languages. 33-40 - Richard B. Kieburtz, Jonathan C. Shultis:
Transformations of FP program schemes. 41-48 - Gérard Berry:
Programming with concrete data structures and sequential algorithms. 49-58 - Deepak Kapur, David R. Musser, Alexander A. Stepanov:
Operators and algebraic structures. 59-64 - John Darlington, Mike Reeve:
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages. 65-76 - Arthur J. Catto, John R. Gurd:
Resource management in dataflow. 77-84 - D. A. Turner:
The semantic elegance of applicative languages. 85-92 - Gyula Magó:
Copying operands versus copying results: A solution to the problem of large operands in FFP'S. 93-98 - Donald F. Stanat, E. Hollins Williams Jr.:
Optimal associative searching on a cellular computer. 99-106 - H. A. Presnell, Roy P. Pargas:
Communication along shortest paths in a tree machine. 107-114 - Donald MacDavid Tolle:
Implanting FFP trees in binary trees: An architectural proposal. 115-122 - Robert M. Keller, Gary Lindstrom:
Applications of feedback in functional programming. 123-130 - Robert M. Keller, M. Ronan Sleep:
Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages. 131-140 - Bengt Nordström:
Programming in Constructive Set Theory: Some examples. 141-154 - Michel Sintzoff:
Proof-oriented and applicative valuations in definitions of algorithms. 155-162 - John S. Conery, Dennis F. Kibler:
Parallel interpretation of logic programs. 163-170 - Keith L. Clark, Steve Gregory:
A relational language for parallel programming. 171-178 - Rex L. Page, M. G. Conant, Dale H. Grit:
If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs. 179-186 - F. Warren Burton, M. Ronan Sleep:
Executing functional programs on a virtual tree of processors. 187-194 - Peter Buneman, Rishiyur S. Nikhil, Robert E. Frankel:
A practical functional programming system for databases. 195-202 - Vishv M. Malhotra, V. Rajaraman:
A data-flow language for specifying business data processing applications. 203-212 - Bruce J. MacLennan:
Introduction to relational programming. 213-220 - Geoffrey A. Frank:
Specification of data structures for FP programs. 221-228
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-29 22:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
