Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
288
Applications of Languages with Self-Interpreters to Partial Terms and Functional Programming
"... Abstract —Those programming languages that contain self-interpreters have the added power of reflection, and allow dynam-ically controlling execution. In a logical language a complete self-interpreter is necessarily inconsistent. However, we demonstrate a logical language with a reasonably complete ..."
Abstract
- Add to MetaCart
self-interpreter. We argue for its use as a simple formalism for reasoning about partial terms, and functional languages that allow both general recursion and dependent types. Since refinements of programming specifications often include partial terms, they need to be handled using formal rules
A Denotational Semantics of Inheritance
, 1989
"... This thesis develops a semantic model of inheritance and investigates its applications for the analysis and design of programming languages. Inheritance is a mechanism for incremental programming in the presence of self-reference. This interpretation of inheritance is formalized using traditional te ..."
Abstract
-
Cited by 146 (8 self)
- Add to MetaCart
This thesis develops a semantic model of inheritance and investigates its applications for the analysis and design of programming languages. Inheritance is a mechanism for incremental programming in the presence of self-reference. This interpretation of inheritance is formalized using traditional
Inverting the Database
- Final Report for NSF Grant IRI
, 2001
"... We wish to propose a database architecture combining a general view of bioinformatics data as a graph of nodes (data objects) and edges (data relationships), with the efficiency and robustness of data management and query provided by indexing and generic programming techniques. We refer to this arch ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
information. The second-class status of indexing stands in contrast to its increasing importance. In this paper we invert the role of the index, and make it a first-class citizen in the query language. It is possible to do this in a structured way, allowing users to mention indexes explicitly without yielding
An Injective Language for Reversible Computation
- In Seventh International Conference on Mathematics of Program Construction (MPC 2004
, 2004
"... Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use energy more ffectively. A more recent motivation to understand reversible transformations also comes from the design of editors whe ..."
Abstract
-
Cited by 11 (7 self)
- Add to MetaCart
a history. The language is presented with many examples, and its relationship with Bennett's reversible Turing machine is explained. The language serves as a good model for program construction and reasoning for reversible computers, and hopefully for modelling bi-directional updating
Improving the Reversible Programming Language R and its Supporting Tools
, 2001
"... This project involved improving the functionality and performance of a reversible programming environment developed previously by a team at MIT. Enhancements were made to the R reversible programming language, the R compiler, and the Pendulum reversible processor architecture simulator. Support for ..."
Abstract
- Add to MetaCart
This project involved improving the functionality and performance of a reversible programming environment developed previously by a team at MIT. Enhancements were made to the R reversible programming language, the R compiler, and the Pendulum reversible processor architecture simulator. Support
Extracting semantic hierarchies from a large on-line dictionary
- University of Chicago
, 1985
"... Dictionaries are rich sources of detailed semantic infor-mation, but in order to use the information for natural language processing, it must be organized systematically. This paper describes automatic and semi-automatic procedures for extracting and organizing semantic fea= ture information implici ..."
Abstract
-
Cited by 111 (1 self)
- Add to MetaCart
,000 verbs, producing indexes in which each genus term is associated with the words it defined. The Sprout pro-gram interactively grows a taxonomic "tree " from any specified root feature by consulting the genus index. Its output is a tree in which all of the nodes have the root feature
Translucent Abstraction: Safe Views through Invertible Programming
"... Despite the distinctive advantages of pattern matching in program understanding and reasoning, the tight coupling of interface and implementation has hampered its wider acceptance. Since the first proposal of views two decades ago, significant effort has been invested in tackling this non-modularity ..."
Abstract
- Add to MetaCart
based on a right-invertible language. The language is sufficiently expressive to program many of the existing and some novel view applications, with simple and sound reasoning properties: views can be manipulated as if they were datatypes and equivalent programs with respect to reasoning are guaranteed
Materials for an exploratory theory of the network society.
- The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract
-
Cited by 122 (0 self)
- Add to MetaCart
t by obtaining a product, consuming (unevenly) part of it, and accumulating the surplus for investment, according to socially decided goals. Consumption is the appropriation of the product by humans for their individual bene t. Analytically, it is a component of the production process, seen from the reverse side
Google’s MapReduce Programming Model — Revisited
"... Google’s MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including its advancement as Google’s domain-specific language Sawzall. To this end, we reverse-engineer the seminal papers on MapReduce a ..."
Abstract
-
Cited by 82 (1 self)
- Add to MetaCart
Google’s MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including its advancement as Google’s domain-specific language Sawzall. To this end, we reverse-engineer the seminal papers on Map
Declarative Semantics of a Meta-Programming Language
- Proc. of the Second Workshop on Meta-programming in Logic. April 4–6
, 1990
"... . We present a logical programming language, generative clause programs, which generalize definite clause programs with a meta-programming level. The fundamental notion in the language is that of a meta-goal which consists of a plain goal together with a program in which it is expected to be true. T ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
for the language. 1 Introduction A meta-level in logic programming is traditionally introduced by means of a selfinterpreter programmed in the logical language itself, e.g., (Bowen, Kowalski, 1982, Bowen, Weinberg, 1985, Bowen, 1985, Hill, Lloyd, 1988, Subrahmanian, 1988). In this way, the access to the meta
Results 1 - 10
of
288
