Filters








220 Hits in 3.9 sec

The choice of programming primitives for SETL-like programming languages [chapter]

E. Dahlhaus, J. A. Makowsky
1986 Lecture Notes in Computer Science  
We discuss the choice of programming primitives for set oriented programnung languages such as SETL For this purpose we introduce a mathematical model (hereditarily finite sets with urelements).  ...  In this model criteria for the choice of programming prknittves are defined. The criteria are complexity, independence and computational completeness of the basic constructs.  ...  The question we want to discuss here ls the choice of programming primitives for SETLlike programming languages.  ... 
doi:10.1007/3-540-16442-1_12 fatcat:gkwulghdwrdpxdaac2sjlb7j7e

Automatic data structure choice in a language of very high level

J. T. Schwartz
1975 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '75  
This paper describes the structure of an optimizer for this language.  ...  SETL is a set-theoretically oriented language of very high level whose repertoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples usable as mappings.  ...  the primitives of the language L to be analyzed.  ... 
doi:10.1145/512976.512981 dblp:conf/popl/Schwartz75 fatcat:vc7kdrmh25a57hwuehe27s7xii

Automatic data structure choice in a language of very high level

J. T. Schwartz
1975 Communications of the ACM  
This paper describes the structure of an optimizer for this language.  ...  SETL is a set-theoretically oriented language of very high level whose repertoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples usable as mappings.  ...  the primitives of the language L to be analyzed.  ... 
doi:10.1145/361227.361235 fatcat:xejamt7fwzcbrir57sf3b7fobm

Experience with the SETL Optimizer

Stefan M. Freudenberger, Jacob T. Schwartz, Micha Sharir
1983 ACM Transactions on Programming Languages and Systems  
The structure of an existing optimizer for the very high-level, set theoretically oriented programming language SETL is described, and its capabilities are illustrated.  ...  The use of novel techniques (supported by state-of-the-art interprocedural program analysis methods) enables the optimizer to accomplish various sophisticated optimizations, the most significant of which  ...  SETL is a procedural language whose elementary data types are essentially those primitive types familiar from other languages, for example, PASCAL (integers, Booleans, strings, and "atoms," for an explanation  ... 
doi:10.1145/357195.357197 fatcat:xpf2wmgfzbcpll2djp2yxmokwi

Set-based Nondeterministic Declarative Programming in Singleton

Gianfranco Rossi
2002 Electronical Notes in Theoretical Computer Science  
of conventional programming languages we are accustomed to and that we do not want to give up, such as the syntactic form of programs, the deterministic control structures-in particular the iterative ones  ...  consequently the recursion based nature of many LP programs.  ...  Acknowledgments I wish to thank Barbara Baiocchi for her contribution to the development of the Singleton compiler.  ... 
doi:10.1016/s1571-0661(04)80795-3 fatcat:xjg7tzxtxzd7lmxf77s6trvypq

Approaches to Automatic Programming [chapter]

Charles Rich, Richard C. Waters
1993 Advances in Computers  
This paper is an overview of current approaches to automatic programming organized around three fundamental questions that must be addressed in the design of any automatic programming system: What does  ...  How does the system work? What does the system know? As an example of a research effort in this area, we focus the Programmerś Apprentice project.  ...  Unfortunately, while this research points in the direction of long term progress, it has not yet had very much impact on commercial systems.  ... 
doi:10.1016/s0065-2458(08)60402-7 fatcat:q4zbeodefjatbkwjlvg4x2j32e

Modeling question asking using neural program generation [article]

Ziyun Wang, Brenden M. Lake
2021 arXiv   pre-print
We propose a neuro-symbolic framework for modeling human question asking, which represents questions as formal programs and generates programs with an encoder-decoder based deep neural network.  ...  From extensive experiments using an information-search game, we show that our method can predict which questions humans are likely to ask in unconstrained settings.  ...  The natural language translations of the question programs are provided for interpretation.  ... 
arXiv:1907.09899v4 fatcat:fzxkye63tfgsdl3tjwve2rdnce

Towards a software product line of trie-based collections

Michael J. Steindorfer, Jurgen J. Vinju
2016 Proceedings of the 2016 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences - GPCE 2016  
Collection data structures in standard libraries of programming languages are designed to excel for the average case by carefully balancing memory footprint and runtime performance.  ...  Although a wide range of specialized collections is available for the Java Virtual Machine (JVM), they introduce yet another dependency and complicate user adoption by requiring specific Application Program  ...  None of these results tackle the generation of basic collection APIs like the current paper does. Specializing for Primitive Data Types. Ureche et al.  ... 
doi:10.1145/2993236.2993251 dblp:conf/gpce/SteindorferV16 fatcat:5wll7snauvhjne4rtuuoikx6ym

Automatic design and implementation of language data types

S. T. Shebs, R. R. Kessler
1987 Papers of the Symposium on Interpreters and interpretive techniques - SIGPLAN '87  
Of the several parts of a runtime system, the primitive datatype definition s present some of the most difficult decisions for the implementor .  ...  Abstrac t Language implementation is in need of automation .  ...  We thank the members of the Utah Portable AI Support Systems group, especiall y Harold Carr, Jed Krohnfeldt, and Sandra Loosemor e for many discussions, not to mention reading draft s on short notice!  ... 
doi:10.1145/29650.29653 dblp:conf/pldi/ShebsK87 fatcat:ifr2k3v325enbdkwn2udrlqzby

Semantic and syntactic issues in programming

J. T. Schwartz
1974 Bulletin of the American Mathematical Society  
[March We will now represent the procedure just described in a settheoretic programming language, specifically in the SETL language developed by the present author and various collaborators (cf.  ...  the fundamental semantic syntactic elements of a programming language.  ...  Another example of current programming research: Nondeterministic programming. Still another active area of current work is the search for more general abstract machine models, i.e. of new  ... 
doi:10.1090/s0002-9904-1974-13431-2 fatcat:ppgpsnbgz5cz7j27j4mm6u6uv4

Mechanical translation of set theoretic problem specifications into efficient RAM code — A case study [chapter]

Robert Paige, Fritz Henglein
1985 Lecture Notes in Computer Science  
This paper explains the conceptual underpinnings of our approach by considering the problem of attribute closure for relational databases and systematically deriving a program that implements a linear  ...  The user is only required to supply the system with a formal problem specification, and is relieved of all responsibilities in the rest of the program development process.  ...  It is useful to begin discussing our method by dividing the primitive set operations into We have to provide concrete data structures for all the stored sets in a program.  ... 
doi:10.1007/3-540-15984-3_329 fatcat:4kp2iyofqfbwfapoxy57wpckky

Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study

Robert Paige, Fritz Henglein
1987 Journal of symbolic computation  
This paper explains the conceptual underpinnings of our approach by considering the problem of attribute closure for relational databases and systematically deriving a program that implements a linear  ...  The user is only required to supply the system with a formal problem specification, and is relieved of all responsibilities in the rest of the program development process.  ...  It is useful to begin discussing our method by dividing the primitive set operations into We have to provide concrete data structures for all the stored sets in a program.  ... 
doi:10.1016/s0747-7171(87)80066-4 fatcat:li5neahaergwnios53v5trdzgi

Program Transformation Systems

H. Partsch, R. Steinbrüggen
1983 ACM Computing Surveys  
Interest is increasing in the transformational approach to programming and in mechanical aids for supporting the program development process.  ...  This paper reviews and classifies transformation systems and is intended to acquaint the reader with the current state of the art and provide a basis for comparing the different approaches.  ...  MSller, and the anonymous referees of COM-PUTING SURVEYS for critical remarks and helpful suggestions on earlier versions of this paper. Comments by J. Darlington, M. Feather, and B.  ... 
doi:10.1145/356914.356917 fatcat:n3fsxgfsgngedkmtflmt7wl4p4

A laboratory for the study of automating programming

T. E. Cheatham, Ben Wegbreit
1971 Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall)  
most of the facilities proposed for the language SETL.  ...  SNOBOL 4, and SETL, and to carefully provide for efficient data representation and machine algorithms to host these extended language facilities.  ... 
doi:10.1145/1478873.1478876 dblp:conf/afips/CheathamW72 fatcat:5h7vohob55akvmitexsya5ee7i

A laboratory for the study of automating programming

T. E. Cheatham, Ben Wegbreit
1972 ACM SIGSAM Bulletin  
most of the facilities proposed for the language SETL.  ...  SNOBOL 4, and SETL, and to carefully provide for efficient data representation and machine algorithms to host these extended language facilities.  ... 
doi:10.1145/1086784.1086785 fatcat:m2dlfjmpcrfjbbu7tqmdgtfmtm
« Previous Showing results 1 — 15 out of 220 results