Results 11  20
of
2,798
Lazy List Comprehension in Logic Programming
"... The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Th ..."
Abstract
 Add to MetaCart
logic as programming language is the logic of Horn clauses, usually regarded as the theoretical foundation of the programming language prolog. A set of Horn clauses can be viewed as a set of recursive definitions for predicates where the defining expressions are built using standard logical connectives
The Logic of Bunched Implications
 BULLETIN OF SYMBOLIC LOGIC
, 1999
"... We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live sidebyside. The propositional version of BI arises from an analysis of the prooftheoretic relationship between conjunction and implication; it can be viewed as a merging of intuition ..."
Abstract

Cited by 219 (42 self)
 Add to MetaCart
We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live sidebyside. The propositional version of BI arises from an analysis of the prooftheoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of BI can be seen categorically: models of propositional BI's proofs are given by bicartesian doubly closed categories, i.e., categories which freely combine the semantics of propositional intuitionistic logic and propositional multiplicative intuitionistic linear logic. The predicate version of BI includes, in addition to standard additive quantifiers, multiplicative (or intensional) quantifiers # new and # new which arise from observing restrictions on structural rules on the level of terms as well as propositions. We discuss computational interpretations, based on sharing, at both the propositional and predic...
Lazy Processing and Optimization of Discrete Sequences
 In Proceedings of the JFLA'2000, 2000. In French
, 1999
"... We construct a small arithmetic package operating on discrete sequences: u0 , u1 , u2 , . . . treated as single mathematical entities. Applying functions to sequences by the generalized map, or adding them elementwise is quite trivial, but if the sequences are regular, e.g. if they are arithmetic ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
or geometric progressions, a much more compact and in several cases much more e#cient representation is possible. For example any polynomial of an arithmetic infinite sequence has an easily coded, and e#ciently processed finite representation through its forward di#erences. Even in more general cases, the lazy
Lazy Model Expansion: Interleaving Grounding with Search
, 2014
"... Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in some logic. The stateoftheart approach for bounded model generation for rich knowledge representation languages, like A ..."
Abstract
 Add to MetaCart
; if that fails, the formula is split in a part to be grounded and a part that can be justified. The theoretical framework captures existing approaches for tackling the grounding bottleneck such as lazy clause generation, groundingonthefly and presents a generalization of the 2watched literal scheme. We
Implementing Mathematics with The Nuprl Proof Development System
, 1986
"... Problem solving is a significant part of science and mathematics and is the most intellectually significant part of programming. Solving a problem involves understanding the problem, analyzing it, exploring possible solutions, writing notes about intermediate results, reading about relevant methods, ..."
Abstract

Cited by 190 (18 self)
 Add to MetaCart
Problem solving is a significant part of science and mathematics and is the most intellectually significant part of programming. Solving a problem involves understanding the problem, analyzing it, exploring possible solutions, writing notes about intermediate results, reading about relevant methods, checking results, and eventually assembling a solution. Nuprl is a computer system which provides assistance with this activity. It supports the interactive creation of proofs, formulas, and terms in a formal theory of mathematics
Compositional BDD Construction: A Lazy Algorithm
, 1998
"... The efficient Binary Decision Diagram algorithm presented in Brace, Rudell and Bryant 1990 [3] is modi#ed to operate in a lazy or demanddriven fashion. We show how this new approach benefits the area of symbolic model checking by reducing the amount of statespace that needs to be evaluated. The ne ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The efficient Binary Decision Diagram algorithm presented in Brace, Rudell and Bryant 1990 [3] is modi#ed to operate in a lazy or demanddriven fashion. We show how this new approach benefits the area of symbolic model checking by reducing the amount of statespace that needs to be evaluated
Lazy Autoconfiguration in Mobile Ad Hoc Networks And Dynamic . . .
, 2006
"... In MANETs and similar linkfree networks of communicating objects there is no central authority for naming and connection management. Autoconfiguration of network nodes is therefore desirable and, building on approaches in IPv6, a number of `zero configuration' networking protocols have been ..."
Abstract
 Add to MetaCart
extensions of smallest possible length, assuming that objects su#ciently mix within their ranges. Finally, the techniques are converted into a fully decentralized, scalable autoconfiguration protocol for use in ad hoc networks with directional antennas. The protocol is `lazy' in the sense that name
Lazy Autoconfiguration in Mobile Ad Hoc Networks
, 2006
"... Abstract. In MANETs and similar linkfree networks of communicating objects there is no central authority for naming and connection management. Autoconfiguration of network nodes is therefore desirable and, building on approaches in IPv6, a number of ‘zero configuration’ networking protocols have be ..."
Abstract
 Add to MetaCart
extensions of smallest possible length, assuming that objects sufficiently mix within their ranges. Finally, the techniques are converted into a fully decentralized, scalable autoconfiguration protocol for use in ad hoc networks with directional antennas. The protocol is ‘lazy ’ in the sense that name
Efficient Data Structures in a Lazy Functional Language
, 2003
"... Although a lot of theoretical work has been done on purely functional data structures, few of them have actually been implemented to general usefulness, let alone as part of a data structure library providing a uniform framework.
In 1998, Chris Okasaki started to change this by implementing Edison, ..."
Abstract
 Add to MetaCart
, a library of efficient data structures for Haskell.
Unfortunately, he abandoned his work after creating a framework and writing some data structure implementations for parts of it.
This document first gives an overview of the current state of Edison and describes what efficiency in a lazy language
Results 11  20
of
2,798