Results 1  10
of
191,422
Embedding Multiset Constraints into a Lazy Functional Logic Language* P.
"... Abstract. In recent works, we have proposed a general framework for lazy functional logic programming with algebraic polymorphic types, i.e., parametric datatypes whose data constructors fulfill a given set of equational axioms. The aim of this paper is to investigate implementation techniques for ..."
Abstract
 Add to MetaCart
Abstract. In recent works, we have proposed a general framework for lazy functional logic programming with algebraic polymorphic types, i.e., parametric datatypes whose data constructors fulfill a given set of equational axioms. The aim of this paper is to investigate implementation techniques
A Unified Framework for Hybrid Control: Model and Optimal Control Theory
 IEEE TRANSACTIONS ON AUTOMATIC CONTROL
, 1998
"... Complex natural and engineered systems typically possess a hierarchical structure, characterized by continuousvariable dynamics at the lowest level and logical decisionmaking at the highest. Virtually all control systems todayfrom flight control to the factory floorperform computercoded chec ..."
Abstract

Cited by 305 (9 self)
 Add to MetaCart
coded checks and issue logical as well as continuousvariable control commands. The interaction of these different types of dynamics and information leads to a challenging set of "hybrid" control problems. We propose a very general framework that systematizes the notion of a hybrid system, combining
Typeful programming
, 1989
"... There exists an identifiable programming style based on the widespread use of type information handled through mechanical typechecking techniques. This typeful programming style is in a sense independent of the language it is embedded in; it adapts equally well to functional, imperative, objectorie ..."
Abstract

Cited by 151 (2 self)
 Add to MetaCart
to languages. We start with an introduction to the notions of types, subtypes and polymorphism. Then we introduce a general framework, derived in part from constructive logic, into which most of the known type systems can be accommodated and extended. The main part of the paper shows how this framework can
Strictness Analysis of Lazy Functional Programs
, 1992
"... Strictness analysis is a compiletime analysis for lazy functional languages. The information gained by a strictness analyser can be used to improve code generation for both sequential and parallel implementations of such languages. After reviewing the syntax and semantics of a simply typed lambda c ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
Strictness analysis is a compiletime analysis for lazy functional languages. The information gained by a strictness analyser can be used to improve code generation for both sequential and parallel implementations of such languages. After reviewing the syntax and semantics of a simply typed lambda
Lazy Type Checking in Functional Logic Programming
"... In this paper we propose a lazy functional and logic language with a type system combining parametric and inclusion polymorphism. Programs in this language consist of an specication of parametric and ordered types together with a set of type declarations for data constructors and functions and a ..."
Abstract
 Add to MetaCart
In this paper we propose a lazy functional and logic language with a type system combining parametric and inclusion polymorphism. Programs in this language consist of an specication of parametric and ordered types together with a set of type declarations for data constructors and functions
An Abstract Interpretation Framework for Semantics and Diagnosis of Lazy FunctionalLogic Languages Candidate:
"... I.1 The functional logic paradigm.......................... iv I.2 Computation properties and semantics..................... v I.3 Abstract interpretation and program analysis................. vi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
I.1 The functional logic paradigm.......................... iv I.2 Computation properties and semantics..................... v I.3 Abstract interpretation and program analysis................. vi
Type Inference with Polymorphic Recursion
 Transactions on Programming Languages and Systems
, 1991
"... The DamasMilner Calculus is the typed Acalculus underlying the type system for ML and several other strongly typed polymorphic functional languages such as Mirandal and Haskell. Mycroft has extended its problematic monomorphic typing rule for recursive definitions with a polymorphic typing rule. H ..."
Abstract

Cited by 145 (3 self)
 Add to MetaCart
The DamasMilner Calculus is the typed Acalculus underlying the type system for ML and several other strongly typed polymorphic functional languages such as Mirandal and Haskell. Mycroft has extended its problematic monomorphic typing rule for recursive definitions with a polymorphic typing rule
Lazy types and Program Analysis
, 1994
"... Approaches to static analysis based on nonstandard type systems have received considerable interest recently. Most work has concentrated on the relationship between such analyses and abstract interpretation. In this paper, we focus on the problem of producing efficient algorithms from such type ..."
Abstract
 Add to MetaCart
based analyses. The key idea is the notion of lazy types. We present the basic notions in the context of a higherorder strictness analysis of listprocessing functions. We also sketch some recent work concerning a general framework for program analysis based on these ideas. We conclude with some experimental
Algebra of logic programming
 International Conference on Logic Programming
, 1999
"... At present, the field of declarative programming is split into two main areas based on different formalisms; namely, functional programming, which is based on lambda calculus, and logic programming, which is based on firstorder logic. There are currently several language proposals for integrating th ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
of the thesis we develop and discuss a framework which forms the basis for our algebraic analysis and transformation methods. The framework is based on an embedding of definite logic programs into lazy functional programs in Haskell, such that both the declarative and the operational semantics of the logic
Draft Lazy Functional Incremental Parsing
"... Structured documents are commonly edited using a freeform editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the edited document. The structured representation has a number of uses: structural navigation (and optional structural edit ..."
Abstract
 Add to MetaCart
Structured documents are commonly edited using a freeform editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the edited document. The structured representation has a number of uses: structural navigation (and optional structural
Results 1  10
of
191,422