標(biāo)題: Titlebook: Algebraic Approaches to Program Semantics; Ernest G. Manes,Michael A. Arbib Book 1986 Springer Science+Business Media New York 1986 Boolea [打印本頁] 作者: Disclose 時(shí)間: 2025-3-21 16:45
書目名稱Algebraic Approaches to Program Semantics影響因子(影響力)
書目名稱Algebraic Approaches to Program Semantics影響因子(影響力)學(xué)科排名
書目名稱Algebraic Approaches to Program Semantics網(wǎng)絡(luò)公開度
書目名稱Algebraic Approaches to Program Semantics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algebraic Approaches to Program Semantics被引頻次
書目名稱Algebraic Approaches to Program Semantics被引頻次學(xué)科排名
書目名稱Algebraic Approaches to Program Semantics年度引用
書目名稱Algebraic Approaches to Program Semantics年度引用學(xué)科排名
書目名稱Algebraic Approaches to Program Semantics讀者反饋
書目名稱Algebraic Approaches to Program Semantics讀者反饋學(xué)科排名
作者: 飛來飛去真休 時(shí)間: 2025-3-21 22:08 作者: strdulate 時(shí)間: 2025-3-22 03:50
Equational Specificationd have been partially implemented in experimental languages such as CLEAR, ACT ONE, CLU, and others. This provides a tool to define data types useful in programming and additionally promises to make available a useful research aid for pure mathematicians who study equationally defined algebraic structures.作者: 陶瓷 時(shí)間: 2025-3-22 08:15
Collective Employment Agreementsefine “natural number” by 0 is a natural number if . is a natural number .0 is a natural number which is captured by the recursive specification. where we represent each number . by a string of zeros of length . + 1. A central concern will be to provide precise semantics to such specifications.作者: ligature 時(shí)間: 2025-3-22 09:43 作者: 反抗者 時(shí)間: 2025-3-22 13:02
Book 1986ng machines. The 1940s saw the construction of the first electronic computers, and the next 20 years saw the evolution of higher-level programming languages in which programs could be written in a convenient fashion independent (thanks to compilers and interpreters) of the architecture of any specif作者: Indict 時(shí)間: 2025-3-22 19:05
Basic Properties of the Fourier Transformed with . whereby the first stage in compiling a program is to check its text to see if it is syntactically valid. In practice, syntax must be described at two levels, for a human user through programming manuals and as a syntax-checking algorithm within a compiler or interpreter.作者: 廣口瓶 時(shí)間: 2025-3-22 22:42
Basic Properties of the Fourier Transformfor semantics which possess so little structure that most models of semantics can be represented this way. Surprisingly, what structure remains can be extensively developed and there is a great deal to say.作者: 高射炮 時(shí)間: 2025-3-23 05:14
Decent Work and Economic Growthd have been partially implemented in experimental languages such as CLEAR, ACT ONE, CLU, and others. This provides a tool to define data types useful in programming and additionally promises to make available a useful research aid for pure mathematicians who study equationally defined algebraic structures.作者: 爭吵加 時(shí)間: 2025-3-23 08:57
0172-603X , and Turing machines. The 1940s saw the construction of the first electronic computers, and the next 20 years saw the evolution of higher-level programming languages in which programs could be written in a convenient fashion independent (thanks to compilers and interpreters) of the architecture of 作者: 開頭 時(shí)間: 2025-3-23 11:46 作者: 啜泣 時(shí)間: 2025-3-23 16:48 作者: 頭盔 時(shí)間: 2025-3-23 20:12 作者: 細(xì)絲 時(shí)間: 2025-3-23 23:17
Parametric Specificational functors have least fixed points. In this sense . is a “parameter” for the “l(fā)ists-of-” specifier. The specific parameter . may itself arise from another data type specification and may live in a category of arbitrary complexity subject to the technical needs of semantics.作者: irreparable 時(shí)間: 2025-3-24 05:29
https://doi.org/10.1007/978-3-319-95867-5ws from the uniqueness assertion in the Banach theorem. Finally, we show in Section 9.4 that the language defined by a context-free grammar often arises as the unique fixed point of the Banach theorem.作者: Offset 時(shí)間: 2025-3-24 09:12 作者: 安心地散步 時(shí)間: 2025-3-24 12:33 作者: nutrition 時(shí)間: 2025-3-24 17:47
0172-603X seeks a logical proof that the program satisfies its specification. An alternative approach, pioneered by Scott and Strachey, is called denotational semantics:978-1-4612-9377-4978-1-4612-4962-7Series ISSN 0172-603X Series E-ISSN 2512-5486 作者: 無法治愈 時(shí)間: 2025-3-24 21:23 作者: 蚊子 時(shí)間: 2025-3-25 02:12
An Introduction to Category Theory .. In addition to the need to consider., . as “data structures,” there are theoretical approaches to semantics in which all ., . must carry further structure. Rather than embark on the misguided task of presenting an exhaustive list of present and future possibilities, we introduce. as a framework 作者: 構(gòu)想 時(shí)間: 2025-3-25 05:02 作者: FILLY 時(shí)間: 2025-3-25 10:28 作者: 讓空氣進(jìn)入 時(shí)間: 2025-3-25 14:05
Fixed Points in Metric Spaceseas of mathematics. In Section 9.1 we prove a classical result due (essentially) to S. Banach that under appropriate hypotheses, an endomorphism . of a nonempty metric space has a unique fixed point .—indeed . is the limit (in the sense of ever decreasing distance) of the sequence ..,..,....,… with 作者: 受人支配 時(shí)間: 2025-3-25 17:10
Functors combining, manipulating, and querying of such elements. A very rich supply of data types may be built—either directly or recursively—from finite sets using finite products and coproducts. Thus, if . is a character alphabet, . x . x . is “l(fā)ength 3 character arrays.” If pr.: . x . x . → . is the .th 作者: critic 時(shí)間: 2025-3-25 22:29 作者: B-cell 時(shí)間: 2025-3-26 02:06
Order Semantics of Data Typestics in which every data type is a domain and every computed function is continuous. We provide a critique of these basic assumptions in Section 1, but then proceed to develop an introduction to this theory of ordered semantics in the remaining sections.作者: 指派 時(shí)間: 2025-3-26 07:54
Equational Specifications of data types which arise as many-sorted algebras. An “equational specification” for a data type posits a many-sorted algebraic structure subject to a finite set of equations. What is attractive about this idea is that equational specifications are easily formalized within programming languages an作者: 合乎習(xí)俗 時(shí)間: 2025-3-26 11:15 作者: organic-matrix 時(shí)間: 2025-3-26 15:14 作者: optic-nerve 時(shí)間: 2025-3-26 18:13 作者: 使無效 時(shí)間: 2025-3-27 00:51
Takashi Hoshiba,Naoki Kawazoe,Guoping Chenprior to the computer age. Here, the art of separating out “improper” recursive definitions was regarded as but one of the many skills necessary to write correct mathematics. But modern computer languages allow recursive specification to be expressed directly. Since the implementation of a programmi作者: entreat 時(shí)間: 2025-3-27 02:37 作者: indoctrinate 時(shí)間: 2025-3-27 05:55 作者: modish 時(shí)間: 2025-3-27 09:46
Decent Work and Economic Growth. followed by a list). But the parenthetical explication just given works only in ., whereas the specification works in any category in which polynomial functors have least fixed points. In this sense . is a “parameter” for the “l(fā)ists-of-” specifier. The specific parameter . may itself arise from an作者: 使顯得不重要 時(shí)間: 2025-3-27 16:59 作者: MILK 時(shí)間: 2025-3-27 19:19
Decent Work and Economic Growths of data types which arise as many-sorted algebras. An “equational specification” for a data type posits a many-sorted algebraic structure subject to a finite set of equations. What is attractive about this idea is that equational specifications are easily formalized within programming languages an作者: 向宇宙 時(shí)間: 2025-3-27 23:49 作者: 鳴叫 時(shí)間: 2025-3-28 04:22
Order Semantics of Data Typestics in which every data type is a domain and every computed function is continuous. We provide a critique of these basic assumptions in Section 1, but then proceed to develop an introduction to this theory of ordered semantics in the remaining sections.作者: 完整 時(shí)間: 2025-3-28 08:18 作者: Middle-Ear 時(shí)間: 2025-3-28 11:29
Algebraic Approaches to Program Semantics978-1-4612-4962-7Series ISSN 0172-603X Series E-ISSN 2512-5486 作者: CLAP 時(shí)間: 2025-3-28 18:13 作者: Latency 時(shí)間: 2025-3-28 20:11
Decent Work and Economic Growthtics in which every data type is a domain and every computed function is continuous. We provide a critique of these basic assumptions in Section 1, but then proceed to develop an introduction to this theory of ordered semantics in the remaining sections.作者: ectropion 時(shí)間: 2025-3-29 00:49
https://doi.org/10.1007/978-1-4612-4962-7Boolean algebra; computer; control; evolution; formal language; formal languages; functional programming; m作者: angina-pectoris 時(shí)間: 2025-3-29 05:19
978-1-4612-9377-4Springer Science+Business Media New York 1986作者: BROTH 時(shí)間: 2025-3-29 07:24 作者: nullify 時(shí)間: 2025-3-29 14:04 作者: Expediency 時(shí)間: 2025-3-29 16:08
Collective Employment AgreementsThe previous chapter considered a number of situations in which an object of semantic interest arises as the least fixed point of a continuous map .:(., ≤)→(., ≤) of some domain (., ≤). So far, the domain structure is but a technical device to distinguish the . fixpoint from the other fixed points.作者: Initiative 時(shí)間: 2025-3-29 20:48 作者: 我還要背著他 時(shí)間: 2025-3-30 02:29
https://doi.org/10.1007/978-3-319-95867-5Just as posets generalize categories, the Kleene fixed point theorem of . generalizes to provide a “co-continuous” endofunctor ψ: .→. with a least fixed point as the “colimit” of the “right chain”作者: Control-Group 時(shí)間: 2025-3-30 06:09
Assertion SemanticsIn the introductory Section 4.1 we informally define partial correctness assertions and notions relating to weakest preconditions with the Pascal fragment of Section 1.2 in mind. Here, we state a number of well-known properties and proof rules whose truth is intuitively evident.作者: Endometrium 時(shí)間: 2025-3-30 10:20
Order Semantics of RecursionThe task of the next three chapters is to better understand the abstract principles underlying the ideas associated with recursive definitions of partial functions as presented in Chapter 5 and to thereby elevate the theory to a wide class of semantic categories.作者: 模范 時(shí)間: 2025-3-30 14:35
Canonical Fixed PointsThe previous chapter considered a number of situations in which an object of semantic interest arises as the least fixed point of a continuous map .:(., ≤)→(., ≤) of some domain (., ≤). So far, the domain structure is but a technical device to distinguish the . fixpoint from the other fixed points.作者: 打包 時(shí)間: 2025-3-30 17:12
Partially Additive Semantics of RecursionIn Section 5.2, we used partially additive semantics in . to describe a number of examples of recursive specification as “power-series” maps . in which the Kleene semantics could alternatively be given by the pattern-of-calls expansion.作者: dilute 時(shí)間: 2025-3-30 21:37 作者: 斥責(zé) 時(shí)間: 2025-3-31 02:02
Response of Continuous- and Discrete-Time Systems,n wollen, wie wir Ver?nderungen erreichen und wie wir die Erreichung unserer Ver?nderungsziele messen. In diesem Sinne sind die Definition und Operationalisierung der Entwicklung im mittleren und h?heren Alter relevant für die Formulierung von Kriterien für pers?nliches Wachstum, die Erforschung von作者: FRAUD 時(shí)間: 2025-3-31 07:57 作者: 共棲 時(shí)間: 2025-3-31 13:00
