this paper proposes a new framework for a polytypic extension of functional programming languages. A functional polytypic program is one that is parameterised by datatype. Since polytypic functions are defined by indu...
详细信息
ISBN:
(纸本)354066677X
this paper proposes a new framework for a polytypic extension of functional programming languages. A functional polytypic program is one that is parameterised by datatype. Since polytypic functions are defined by induction on types rather than by induction on values, they typically operate on a higher level of abstraction than their monotypic counterparts. However, polytypic programming is not necessarily more complicated than conventional programming. In fact, a polytypic function is uniquely defined by its action on constant functors, projection functors, sums, and products. this information is sufficient to specialize a polytypic function to arbitrary datatypes, including mutually recursive datatypes and nested datatypes. the key idea is to use infinite trees as index sets for polytypic functions and to interpret datatypes as algebraic trees. this approach is simpler, more general, and more efficient than previous ones that are based on the initial algebra semantics of datatypes.
LogScheme is an experiment in adding the main features of logicprogramming, nondeterminism and unification, into the (mostly) functional language Scheme. We use a minimalist approach, based on the observation that no...
详细信息
We study how to preserve universal termination besides computed answer substitutions while transforming definite programs. We consider the unfold operation both alone and combined withthe introduction of a new defini...
详细信息
We describe LC, a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler ope...
详细信息
this paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is defined which given a logic program computes a TRS. For a relevant class of logic programs, ca...
详细信息
the dynamic fuzzy logic (DFL) programming language can deal with dynamic fuzzy data that is the special difference from other programming languages. In order to implement DFL programming language, some suitable data t...
详细信息
ISBN:
(纸本)9780769528748
the dynamic fuzzy logic (DFL) programming language can deal with dynamic fuzzy data that is the special difference from other programming languages. In order to implement DFL programming language, some suitable data types of it also should be defined. this paper describes primitive data types of DFL programming language and the mechanism of constructing other data types through extending the primitive data types. Withthe aim of concretely analyzing dynamic fuzzy data, it is necessary to modify the classical lambda calculus by adding a dynamic fuzzy degree to each term.
the proceedings contain 28 papers. the topics discussed include: weak Kleene algebra and computation trees;finite symmetric integral relation algebras with no 3-cycles;an axiomatization of arrays for Kleene algebra wi...
详细信息
ISBN:
(纸本)3540378731
the proceedings contain 28 papers. the topics discussed include: weak Kleene algebra and computation trees;finite symmetric integral relation algebras with no 3-cycles;an axiomatization of arrays for Kleene algebra with tests;on the complexity of the equational theory of relational action algebras;topological representation of contact lattices;betweenness and comparability obtained from binary relations;relational representation theorems for general lattices with negations;semigroupoid interfaces for relation-algebraicprogramming in Haskell;evaluating sets of search points using relational algebra;algebraization of hybrid logic with binders;monotone predicate transformers as up-closed multirelations;homomorphism and isomorphism theorems generalized from a relational perspective;a relational view of recurrence and attractors in state transition dynamics;on two dually nondeterministic refinement algebras;and on the fixpoint theory of equality and its applications.
this paper describes an infrastructural system designed for applications ill the factory automation, which is named Glue logic, and a real-time control system with layer structure build oil this system. the Glue logic...
详细信息
ISBN:
(纸本)0792373588
this paper describes an infrastructural system designed for applications ill the factory automation, which is named Glue logic, and a real-time control system with layer structure build oil this system. the Glue logic provides an environment which supports the programming, controlling and monitoring the production system, and also supports efficient manufacturing programming with high program modularity and re-usability. Furthermore, this system includes event notification message sending and condition monitoring features by means of active database technique. the authors proposed an architecture paradigm for scalable intelligent control systems, and implemented a model train control system on the Glue logic as a sample, which has layered architecture derived from the subsumption architecture.
the proceedings contain 14 papers. the topics discussed include: reflecting linear arithmetic: from dense linear orders to Presburger arithmetic;lightweight verification with dependent types;trends and challenges in s...
the proceedings contain 14 papers. the topics discussed include: reflecting linear arithmetic: from dense linear orders to Presburger arithmetic;lightweight verification with dependent types;trends and challenges in satisfiability modulo theories;formal device and programming model for a serial interface;combinations of theories and the Bernays-Schönfinkel-ramsey class;a history-based verification of distributed applications;symbolic fault injection;a termination checker for Isabelle Hoare logic;the heterogeneous tool set;fully verified JAVA CARD API reference implementation;automated formal verification of PLC programs written in IL;and combining deduction and algebraic constraints for hybrid system analysis.
Constraint functional programming (CEP) is presented as a new declarative programming paradigm. A CFP system is an integrated declarative programming system in which functional programming can be achieved by evaluatin...
详细信息
Constraint functional programming (CEP) is presented as a new declarative programming paradigm. A CFP system is an integrated declarative programming system in which functional programming can be achieved by evaluating expressions on the computational domains. At the same time, logicprogramming can also be achieved by solving constraints over these domains. CFP is developed from the notion of absolute set abstraction, a language construct in functional languages acting as the 'logicprogramming facility'. CFP systematically unifies functional programming and logicprogramming from a fundamental semantic level and is expected to provide great expressive power. Problem solving in CFP is directly performed on the intended domain of discourse. this property also allows some algorithmic constraint solving techniques to be exploited and restricts the search space in the computation to make the system efficient.
暂无评论