作者: 沙草紙 時(shí)間: 2025-3-21 23:46 作者: PAD416 時(shí)間: 2025-3-22 04:15
Sabine Achour,Martin Lücke,Detlef Pechguages based on assertional programming as a uniform presentation of declarative language semantics, and a constraint abstract machine as a general computational model for declarative programming. The PDS provides a methodology for systematically integrating functional and logic programming language作者: Phagocytes 時(shí)間: 2025-3-22 08:00
https://doi.org/10.1007/978-3-658-29556-1traint, functional and logic programming. CFLP extends constraint functional programming (CFP), which supports equation solving over a functional program, to general constraint programming permitting the use of constraints for programming as well as for posing queries. It also generalises constraint作者: Euphonious 時(shí)間: 2025-3-22 10:44 作者: 猛擊 時(shí)間: 2025-3-22 12:56 作者: 猛擊 時(shí)間: 2025-3-22 19:41 作者: ornithology 時(shí)間: 2025-3-23 00:09 作者: TOXIC 時(shí)間: 2025-3-23 04:30 作者: Spinal-Fusion 時(shí)間: 2025-3-23 05:54 作者: Ringworm 時(shí)間: 2025-3-23 12:58
Demokratiep?dagogik und Verantwortungslernenf partially ordered sets of logic program units. We develop for such systems operational, declarative and fixed point semantics which are proven equivalent..We begin by discussing, in logic programming terms, the basic types of inheritance that can be achieved. We identify two kinds, semantic and sy作者: 競(jìng)選運(yùn)動(dòng) 時(shí)間: 2025-3-23 17:31 作者: fertilizer 時(shí)間: 2025-3-23 19:50
Medien, ?ffentliche Meinung und Demoskopieping of functional logic languages to (sequential) target machines. A framework is given for describing, designing and classifying abstract machines. Its core is a design space over basic concepts which have been extracted from existing machines. The design of an abstract machine is obtained by comb作者: fiscal 時(shí)間: 2025-3-23 23:30 作者: miracle 時(shí)間: 2025-3-24 03:04 作者: 違法事實(shí) 時(shí)間: 2025-3-24 09:39
Declarative Programming, Sasbachwalden 1991978-1-4471-3794-8Series ISSN 1431-1682 作者: 膽小鬼 時(shí)間: 2025-3-24 12:02 作者: 心胸狹窄 時(shí)間: 2025-3-24 15:45
https://doi.org/10.1007/978-1-4471-3794-8Logic Programming; Mathematica; artificial intelligence; declarative programming; development; functional作者: 明智的人 時(shí)間: 2025-3-24 20:22 作者: 公豬 時(shí)間: 2025-3-25 01:37
https://doi.org/10.1007/978-3-531-90903-5The concept of S-unification provides a semantically clean way of combining logic programs with functions written in other languages. This paper shows how to implement a logic programming language with S-unification by transforming it to a Prolog program. The scheme is reasonably efficient if Prolog supports efficient coroutining.作者: 極大的痛苦 時(shí)間: 2025-3-25 06:23
Werte-Bildung und Politische BildungThis paper introduces Temporal Constraint Functional Programming (TCFP), a declarative paradigm suitable for concurrent programming. The paper defines an example TCFP language, a method for specifying the semantics of TCFP languages, and the basis of a transformation methodology for TCFP programs. The main advantages of TCFP are:作者: 原告 時(shí)間: 2025-3-25 11:26 作者: Allure 時(shí)間: 2025-3-25 12:08
Temporal Constraint Functional Programming: A Declarative Framework for Concurrency and InteractionThis paper introduces Temporal Constraint Functional Programming (TCFP), a declarative paradigm suitable for concurrent programming. The paper defines an example TCFP language, a method for specifying the semantics of TCFP languages, and the basis of a transformation methodology for TCFP programs. The main advantages of TCFP are:作者: rectum 時(shí)間: 2025-3-25 17:42 作者: 人工制品 時(shí)間: 2025-3-25 22:39 作者: cajole 時(shí)間: 2025-3-26 02:25
How to Use Guarded Functional Programming logic programming, represented by Horn clauses and SLD resolution. The basic programming constructs are guarded equations, i.e. equations conditioned by guards which are Horn logic goals. When an equation is applied to rewrite an expression, its guard must be solved first. If a guard has more than 作者: 控制 時(shí)間: 2025-3-26 06:56
A Tiny Functional Language with Logical Featuresanguages may be defined. This paper describes a denotational semantics based on lower powerdomains, and a polymorphic type system. The calculus has a confluent operational semantics, which may be formulated in several ways—an extension of de Bruijn’s calculus is used here..More useful language const作者: Metastasis 時(shí)間: 2025-3-26 09:52
Eight queens divided: an experience in parallel functional programmingtems. Straightforward parallelisation of the classical algorithm with a fork-join annotation, however, results in poor parallel behaviour because of the strict synchronisation between the adjacent stages in the pipeline of recursive invocations. This paper analyses the performance bottleneck and pro作者: dry-eye 時(shí)間: 2025-3-26 16:18
Intelligent Backtracking in And-Parallel Prologmemory machine where an extended Warren Abstract Machine [1] is placed on each processor and can receive subgoals and spawn further subgoals to other processors..The chosen scheme for the communication of bindings makes available additional run-time information which is incorporated into the executi作者: 阻止 時(shí)間: 2025-3-26 19:01
Parameterized Interfaces are Interfaces — AIASmentation. Both interfaces and implementations can be parameterized, and they are first class citizens, .... any order of parameterization is possible. The interface of the application of a parameterized implementation may depend on the interface of its arguments, .... we have a weaker form of depen作者: 分解 時(shí)間: 2025-3-27 00:36 作者: 一致性 時(shí)間: 2025-3-27 02:44
Syntactic and Semantic Inheritance in Logic Programmingf partially ordered sets of logic program units. We develop for such systems operational, declarative and fixed point semantics which are proven equivalent..We begin by discussing, in logic programming terms, the basic types of inheritance that can be achieved. We identify two kinds, semantic and sy作者: 使痛苦 時(shí)間: 2025-3-27 06:00
A survey of the implementations of narrowingr a program as a conditional term rewriting system, with conditional narrowing as the goal-solving mechanism. If EQLOG [14] is one of the earliest proposals in that direction, many others have since then followed the trend, including SLOG [10], K-LEAF [12], ALF [15], BABEL [18] and many others.作者: BLANK 時(shí)間: 2025-3-27 09:49 作者: exacerbate 時(shí)間: 2025-3-27 13:36
Some Algorithms for Fast and Complete Execution of Logic Programsally and experimentally. In addition to new variants of depth-first iterative-deepening, a novel complete strategy, random iterative-probing, is introduced. The best algorithm in the article combines deep and shallow search and has in comparison with Prolog a much greater class of programs and queri作者: 橡子 時(shí)間: 2025-3-27 19:37
A Common Graphical Formistributed processors. A key feature of the structure is its ability to model disparate abstract machines in a uniform manner; this enables us to experiment with different abstract machines without having to recode major parts of the run-time system for each additional machine. Because we are dealin作者: Ingratiate 時(shí)間: 2025-3-27 23:30
Conference proceedings 1992ty of important technical areas such as foundations and languages, program transformation and analysis, integrated approaches, implementation techniques, abstract machines and programming methodology. The resulting volume provides an in-depth picture of current research into declarative programming.作者: perpetual 時(shí)間: 2025-3-28 03:46 作者: 共同確定為確 時(shí)間: 2025-3-28 08:10
Benedikt Sturzenhecker,Elisabeth Richtererloaded identifiers as well as conformity clauses that declare one abstract type to be more specific than another..The generalization of type classes to abstract types has the advantage of greater expressiveness: We can model polymorphic abstract types and heterogeneous data structures, concepts wh作者: Magnificent 時(shí)間: 2025-3-28 13:30
Demokratiep?dagogik und Verantwortungslernenint semantics, and we prove their equivalence. The equivalence between declarative and operational semantics is based on a two-step reduction of inheritance systems to non-inheritance systems, i.e. systems of standard logic programs, by eliminating first syntactic inheritance and then semantic inher作者: LAST 時(shí)間: 2025-3-28 16:18 作者: esthetician 時(shí)間: 2025-3-28 21:10 作者: Ascribe 時(shí)間: 2025-3-29 01:30 作者: 鋼盔 時(shí)間: 2025-3-29 06:52 作者: MITE 時(shí)間: 2025-3-29 08:56
https://doi.org/10.1007/978-3-531-90903-5 properties. A sample problem is described whereof a taxonomy of functions and relations is derived. It is shown how the programming constructs of GFP* reflect this taxonomy and a systematic solution of the sample problem is outlined.作者: 遷移 時(shí)間: 2025-3-29 14:29 作者: Chivalrous 時(shí)間: 2025-3-29 17:40 作者: 藐視 時(shí)間: 2025-3-29 21:50
How to Use Guarded Functional Programming properties. A sample problem is described whereof a taxonomy of functions and relations is derived. It is shown how the programming constructs of GFP* reflect this taxonomy and a systematic solution of the sample problem is outlined.作者: Stable-Angina 時(shí)間: 2025-3-30 01:56 作者: slow-wave-sleep 時(shí)間: 2025-3-30 05:46
Eight queens divided: an experience in parallel functional programmingm provides no obvious handle to do so. Usage of the .-. transformation is not restricted to the eight queens puzzle, it can be applied to all applications with a comparable recursive iteration pattern.作者: macrophage 時(shí)間: 2025-3-30 12:09 作者: Aboveboard 時(shí)間: 2025-3-30 15:37 作者: 相符 時(shí)間: 2025-3-30 20:09
Sabine Achour,Martin Lücke,Detlef Pechs. We present a simple classification of existing integrated functional and logic programming systems and show how the design space induces a powerful new programming paradigm, constraint functional logic programming, and provides insights into other aspects of declarative programming such as concurrency and program transformation.作者: Graduated 時(shí)間: 2025-3-31 00:21
https://doi.org/10.1007/978-3-658-29556-1 logic programming (CLP), by admitting user-defined functions as a purely functional subsystem of a CLP language. This paper presents the motivation for designing CFLP and its semantics. Programming examples are given in the concrete CFLP language Falcon.
