The proceedings contain 29 papers from the 2ndinternational ACM SIGPLAN conference On principles andpractice Of Declarative programming (PPDP'OO). Topics discussed include: a parallel implementation for optimal ...
详细信息
ISBN:
(纸本)1581132654
The proceedings contain 29 papers from the 2ndinternational ACM SIGPLAN conference On principles andpractice Of Declarative programming (PPDP'OO). Topics discussed include: a parallel implementation for optimal lamda-calculus reduction;logical relations, data abstraction, and structured fibrations;operational semantics and extensionality and linear logic programming with an ordered contexts.
The evolution of the concurrent constraint (cc) programming paradigm was discussed. The development in the programming languages from plain to stochastic language was described. The presence of defaults was reported t...
详细信息
ISBN:
(纸本)1581132654
The evolution of the concurrent constraint (cc) programming paradigm was discussed. The development in the programming languages from plain to stochastic language was described. The presence of defaults was reported to introduce nonmonotonicity into the language.
The concurrent constraint programming paradigm and linear logic are studied. The characterization of the success stores or the constraints of terminal configurations with no suspended agent, requires restricting the d...
详细信息
ISBN:
(纸本)1581132654
The concurrent constraint programming paradigm and linear logic are studied. The characterization of the success stores or the constraints of terminal configurations with no suspended agent, requires restricting the deductions that can be carried-out to forbid logical deletions of agents by weakening. Linear constraint systems greatly enhance the expressive power of concurrent constraint programming.
The semantic analysis of pointer aliasing, allocation and disposal in Hoare logic was done. The semantics was used to validate the component-substitution approach. The substitution approach was used to devise axioms f...
详细信息
ISBN:
(纸本)1581132654
The semantic analysis of pointer aliasing, allocation and disposal in Hoare logic was done. The semantics was used to validate the component-substitution approach. The substitution approach was used to devise axioms for operations that allocate and dispose of memory.
We begin with a review of ordered linear logic (OLL), a refinement of intuitionistic linear logic with an inherent notion of order. We then develop a logic programming interpretation for OLL in two steps: (1) we give ...
详细信息
ISBN:
(纸本)1581132654
We begin with a review of ordered linear logic (OLL), a refinement of intuitionistic linear logic with an inherent notion of order. We then develop a logic programming interpretation for OLL in two steps: (1) we give a system of ordered uniform derivations which is sound and complete with respect to OLL, and (2) we present a model of resource consumption which removes non-determinism from ordered resource allocation during search for uniform derivations. We also illustrate the expressive power of the resulting ordered linear logic programming language with several example programs.
Fixed point based abstract interpretation requires compact representations of functions. In general, finding a fixed point requires exponential time. Good representations allow the reduction of the fixed point solvers...
详细信息
ISBN:
(纸本)1581132654
Fixed point based abstract interpretation requires compact representations of functions. In general, finding a fixed point requires exponential time. Good representations allow the reduction of the fixed point solvers computational complexity. One approach for obtaining compact representations is the use of special classes of functions. In this paper, we focus on the class of component-wise homomorphisms. We show that this class of functions gives more compact representations than component-wise additive functions.
An increasing interest is directed at the extension of the "proof search as computation" paradigm, already successfully applied to Linear Logic, to a logic that is not only resource-aware but also order-sens...
详细信息
ISBN:
(纸本)1581132654
An increasing interest is directed at the extension of the "proof search as computation" paradigm, already successfully applied to Linear Logic, to a logic that is not only resource-aware but also order-sensitive. This paper is a contribution to proof search in Non-Commutative Logic. Our key result is to give a simple method for propagating the order structure during proof search. Such a method is general, in that it can be applied to n-ary connectives. This enables us to define a cluster calculus, which analyses clusters of synchronous and of asynchronous connectives in a single step, with a single n-ary rule.
Identifying the source of space faults in functional programs is hard. The problem is compounded as space usage can vary enormously from one implementation to another. We use a term-graph rewriting model to describe e...
详细信息
ISBN:
(纸本)1581132654
Identifying the source of space faults in functional programs is hard. The problem is compounded as space usage can vary enormously from one implementation to another. We use a term-graph rewriting model to describe evaluators with explicit space usage. Given descriptions for two evaluators E1 and E2, if E1 never has asymptotically worse space usage than E2, we can use a bisimulation-like proof method to prove it. Conversely, if E1 is leakier than E2, we characterise a class of computations that expose the difference between them.
Events play an important role in the construction of most software that involves interaction or simulation. Typically, programmers make use of a fixed set of low level events supplied by a window system, possibly augm...
详细信息
ISBN:
(纸本)1581132654
Events play an important role in the construction of most software that involves interaction or simulation. Typically, programmers make use of a fixed set of low level events supplied by a window system, possibly augmented with timers and UI components. Event handling generally involves some interpretation of these event occurrences, followed by external actions or modifications to program state. It is possible to extend the event paradigm by using an algebra of events to synthesize new kinds of events tailored specifically for a domain or application. In turn, these new events may be used to synthesize yet others, and so on, to an arbitrarily sophisticated degree. This programming paradigm, which we call event-oriented programming, aids in the factoring of programs into understandable and reusable pieces. We propose a declarative approach to event-oriented programming, based on a powerfully expressive event language with a lightweight notation. We illustrate this new approach through the design of an interactive curve editor.
暂无评论