標(biāo)題: Titlebook: Algebraic Methodology and Software Technology (AMAST’93); Proceedings of the T Maurice Nivat,Charles Rattray,Giuseppe Scollo Conference pro [打印本頁(yè)] 作者: 全體 時(shí)間: 2025-3-21 17:10
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)影響因子(影響力)
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)被引頻次
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)年度引用
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)年度引用學(xué)科排名
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)讀者反饋
書(shū)目名稱(chēng)Algebraic Methodology and Software Technology (AMAST’93)讀者反饋學(xué)科排名
作者: CHIDE 時(shí)間: 2025-3-21 23:54
https://doi.org/10.1007/978-1-62703-514-9ng about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras.作者: municipality 時(shí)間: 2025-3-22 04:07
Itamar Kanter,Gur Yaari,Tomer Kalisky format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several formats it is determined what is the coarsest congruence with respect to all operators in this format that is finer than partial or completed trace equivalence.作者: carotenoids 時(shí)間: 2025-3-22 05:17 作者: 土坯 時(shí)間: 2025-3-22 10:58
Relation Algebras for Reasoning about Time and Spaceng about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras.作者: 主動(dòng)脈 時(shí)間: 2025-3-22 14:05
Full Abstraction in Structural Operational Semantics (extended abstract) format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several formats it is determined what is the coarsest congruence with respect to all operators in this format that is finer than partial or completed trace equivalence.作者: 健談的人 時(shí)間: 2025-3-22 19:10 作者: Palpitation 時(shí)間: 2025-3-22 23:51
https://doi.org/10.1007/978-1-4684-7867-9applied it to quantifier logics too). The number of applications grew ever since. (Though some of these remained unnoticed, e.g. the celebrated Kripke-Lemmon completeness theorem for modal logic w.r.t. Kripke models was first proved by Jónsson and Tarski in 1948 using algebraic logic.)作者: insidious 時(shí)間: 2025-3-23 05:14 作者: 希望 時(shí)間: 2025-3-23 09:11 作者: 惰性女人 時(shí)間: 2025-3-23 10:56
Applying Algebraic Logic to Logicapplied it to quantifier logics too). The number of applications grew ever since. (Though some of these remained unnoticed, e.g. the celebrated Kripke-Lemmon completeness theorem for modal logic w.r.t. Kripke models was first proved by Jónsson and Tarski in 1948 using algebraic logic.)作者: 不妥協(xié) 時(shí)間: 2025-3-23 13:54
Synchronous Observers and the Verification of Reactive Systemslevel) with determinism. They can be compiled into a very efficient sequential code, by means of a specific compiling technique: The control structure of the object code is a finite automaton which is synthesized by an exhaustive simulation of a finite abstraction of the program.作者: JAMB 時(shí)間: 2025-3-23 19:13
A Coherent Type System for a Concurrent, Functional and Imperative Programming Languaged ML. The resulting specification language is thus highly expressive though it embodies a restricted number of concepts. More concisely our language can be viewed as a sugared version of typed λ-calculus that safely incorporates imperative an concurrent extensions.作者: 并入 時(shí)間: 2025-3-23 23:13
Conference proceedings 1994cal mathematical alternatives to the ad-hoc approaches commonly used in software engineering and development. The first two AMAST conferences, held in May 1989 and May 1991 at the University of Iowa, were well received and encouraged the regular organization of further AMAST conferences on a biennia作者: 有節(jié)制 時(shí)間: 2025-3-24 06:24 作者: CHAR 時(shí)間: 2025-3-24 09:37 作者: Cultivate 時(shí)間: 2025-3-24 13:59
https://doi.org/10.1007/978-3-658-26333-1RLAA is a variety and is the smallest variety including FLAA... LAA’s constitute the widest class of LAA’s that can be represented as an algebra of functions and are known to have a natural intrinsic characterization. We prove that every dimension-complemented LAA is isomorphic to RLAA. This is the crucial step in showing that RLAA is a variety.作者: 引起 時(shí)間: 2025-3-24 17:12
https://doi.org/10.1007/978-3-319-90303-3uch a signature are then used as sorts of another signature now describing a language having the previously defined type system. This way of modeling is not restricted to two levels, and we will show useful applications of three-level algebras.作者: 滲入 時(shí)間: 2025-3-24 22:58
On the value of commutative diagrams in information modellingt as yet untested techniques for information model partitioning and information system architecture. The methodologies described here have a firm theoretical basis using the recently isolated theory of lextensive categories and this basis is briefly outlined.作者: 食草 時(shí)間: 2025-3-25 03:11
Joining Abstract and Concrete Computations in Constraint Logic Programmingstandard) semantic definition. In constraint logic programming, this corresponds to a suitable definition of the constraint system supporting the semantic definition. Both top-down and a bottom-up semantics are considered.作者: gnarled 時(shí)間: 2025-3-25 05:21 作者: pacifist 時(shí)間: 2025-3-25 10:19
Specifying Type Systems with Multi-Level Order-Sorted Algebrauch a signature are then used as sorts of another signature now describing a language having the previously defined type system. This way of modeling is not restricted to two levels, and we will show useful applications of three-level algebras.作者: 輕觸 時(shí)間: 2025-3-25 11:50
https://doi.org/10.1007/978-1-4684-7867-9translating the solution back to logic, goes back to Leibnitz and Pascal. Papers on the history of Logic (e.g. Anellis-Houser [4], Maddux [14]) point out that this method was fruitfully applied in the 19. century not only to propositional logics but also to quantifier logics (De Morgan, Peirce etc. 作者: Herpetologist 時(shí)間: 2025-3-25 19:24 作者: Generic-Drug 時(shí)間: 2025-3-25 22:31 作者: Perineum 時(shí)間: 2025-3-26 01:11
Single-Cell Transcriptome Profiling, failures model are reviewed, and the underlying theory is discussed. The algebraic style of specification is discussed, followed by the behavioural requirement specification approach. A simple timed buffer example is treated using both methods.作者: 劇毒 時(shí)間: 2025-3-26 05:53 作者: Diastole 時(shí)間: 2025-3-26 09:58 作者: 立即 時(shí)間: 2025-3-26 14:27
Ecologies of Encounter: Deep Skins,een concrete and abstract computations in semantics and analysis. We formalize this idea by applying the well known approximation techniques (e.g. the standard theory of closure operators) in conjunction with a generalized notion of constraint system, supporting any program evaluation. The “generali作者: cacophony 時(shí)間: 2025-3-26 18:05 作者: 四海為家的人 時(shí)間: 2025-3-26 22:09
https://doi.org/10.1007/978-3-658-26333-1ion in the methods, using a computational model based on Moschovakis’ search computability. The four specification methods can be characterized by four different notions of semicomputable parameterized abstract data type, which differ in the availability of the parameter algebra and of nondeterminis作者: Ardent 時(shí)間: 2025-3-27 01:17
https://doi.org/10.1007/978-3-658-26333-1es, yet cannot express certain new kinds of abstraction recently identified. In this paper we report on a simple technique we call . and show how this technique can be added to traditional functional languages by the addition of an explicit user programmable phase distinction in their compilation. T作者: 枕墊 時(shí)間: 2025-3-27 06:46
Ecologies of Encounter: Deep Skins,esign of this specification language follows the same approach as the one used in the design of Extended ML [14]. The starting point is the design of an implicitly typed, polymorphic, concurrent and functional programming language. Axioms are then added in the signatures and structures as in Extende作者: 高歌 時(shí)間: 2025-3-27 11:51
What Can Be Seen in an Open Star Cluster?,velopment has been the study of a class of algebras called . (Chin and Tarski 1951, Jónsson 1982), in parallel with developments such as Boolean algebras with operators (Jónsson and Tarski 1951/1952) and cylindric algebras (Henkin, Monk and Tarski 1985). Since the early seventies the algebra of rela作者: SCORE 時(shí)間: 2025-3-27 17:12
What Can Be Observed in Globular Clusters?,whether as a type or as an operation. Two approaches arose in the late 70’s and the early 80’s which will be referred here as the “Munich approach” (see, e.g., [18, 7]) and the “Rio approach” (see, e.g., [13, 12, 22]).作者: ATP861 時(shí)間: 2025-3-27 18:36 作者: pulmonary 時(shí)間: 2025-3-27 23:59 作者: 很是迷惑 時(shí)間: 2025-3-28 02:51 作者: Ligament 時(shí)間: 2025-3-28 09:24
Parameterized Recursion Theory — A Tool for the Systematic Classification of Specification Methodsion in the methods, using a computational model based on Moschovakis’ search computability. The four specification methods can be characterized by four different notions of semicomputable parameterized abstract data type, which differ in the availability of the parameter algebra and of nondeterminism.作者: Crumple 時(shí)間: 2025-3-28 13:03 作者: OWL 時(shí)間: 2025-3-28 16:49
https://doi.org/10.1007/978-1-4471-3227-1Algebraic Specification; Formal Methods; Program Development; design; functional programming; logic; progr作者: 參考書(shū)目 時(shí)間: 2025-3-28 19:51
978-3-540-19852-9British Computer Society 1994作者: 拱形面包 時(shí)間: 2025-3-29 00:31
Algebraic Methodology and Software Technology (AMAST’93)978-1-4471-3227-1Series ISSN 1431-1682 作者: 舊石器時(shí)代 時(shí)間: 2025-3-29 05:25 作者: ATOPY 時(shí)間: 2025-3-29 08:12
https://doi.org/10.1007/978-3-658-26333-1ion in the methods, using a computational model based on Moschovakis’ search computability. The four specification methods can be characterized by four different notions of semicomputable parameterized abstract data type, which differ in the availability of the parameter algebra and of nondeterminism.作者: 虛構(gòu)的東西 時(shí)間: 2025-3-29 13:23
What Can Be Observed in Globular Clusters?,whether as a type or as an operation. Two approaches arose in the late 70’s and the early 80’s which will be referred here as the “Munich approach” (see, e.g., [18, 7]) and the “Rio approach” (see, e.g., [13, 12, 22]).作者: 蘆筍 時(shí)間: 2025-3-29 16:07 作者: 輕觸 時(shí)間: 2025-3-29 19:56
Constraints in Term Algebras (Short Survey)First, we define what is a . and list few possible applications of them. Then, we survey recent results on constraint in term algebras. Finally, we propose a methodology of constraint solving and illustrate it on a toy example.作者: CHANT 時(shí)間: 2025-3-29 23:52 作者: 得意牛 時(shí)間: 2025-3-30 07:54
Relation Algebras for Reasoning about Time and Spacegebras’, relation algebras that arose from James Allen’s work on temporal reasoning, and by ‘compass algebras’, which are designed for similar reasoning about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be 作者: 社團(tuán) 時(shí)間: 2025-3-30 12:16 作者: GIBE 時(shí)間: 2025-3-30 15:23 作者: larder 時(shí)間: 2025-3-30 19:54
Full Abstraction in Structural Operational Semantics (extended abstract)rmats of transition system specifications using Plotkin’s structural approach. For several equivalences in the linear time — branching time spectrum a format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several for作者: Ceremony 時(shí)間: 2025-3-30 21:46 作者: Camouflage 時(shí)間: 2025-3-31 03:14 作者: 一加就噴出 時(shí)間: 2025-3-31 06:32
Dimension-Complemented Lambda Abstraction Algebrasthe first-order predicate logic. Like combinatory algebras they can be denned by true identities and thus form a variety in the sense of universal algebra, but they differ from combinatory algebras in several important respects. The most natural LAA’s are obtained by coordinatizing environment model作者: 細(xì)頸瓶 時(shí)間: 2025-3-31 10:03 作者: phase-2-enzyme 時(shí)間: 2025-3-31 17:02
Increasing the Level of Abstraction in Traditional Functional Languages by Using Compile-time Refleces, yet cannot express certain new kinds of abstraction recently identified. In this paper we report on a simple technique we call . and show how this technique can be added to traditional functional languages by the addition of an explicit user programmable phase distinction in their compilation. T作者: deviate 時(shí)間: 2025-3-31 21:23
A Coherent Type System for a Concurrent, Functional and Imperative Programming Languageesign of this specification language follows the same approach as the one used in the design of Extended ML [14]. The starting point is the design of an implicitly typed, polymorphic, concurrent and functional programming language. Axioms are then added in the signatures and structures as in Extende作者: 深淵 時(shí)間: 2025-3-31 22:17
