作者: 不發(fā)音 時(shí)間: 2025-3-21 22:17
https://doi.org/10.1007/978-1-4612-5080-7he possibility of having a restricted form of . subtyping and the features of the delegation-based language itself. The original type inference system allows both specialization of the type of an inherited method to the type of the inheriting object and static detection of errors, such as ‘ .’. The 作者: 夾克怕包裹 時(shí)間: 2025-3-22 01:37 作者: 持久 時(shí)間: 2025-3-22 08:03 作者: 脆弱么 時(shí)間: 2025-3-22 11:11
The Content of Computer Science,is a list of terms. While the structure of the usual λ-calculus is isomorphic to the structure of natural deduction, this new structure is isomorphic to the structure of Gentzen-style sequent calculus. To express the basis of the isomorphism, we consider intuitionistic logic with the implication as 作者: 灰心喪氣 時(shí)間: 2025-3-22 16:35
https://doi.org/10.1007/978-1-4612-5080-7d on PCF. We discuss some important properties that make usability attractive as a formalisation of (un)definedness. There is a remarkable difference between usability and solvability: in the untyped lambda calculus the solvable terms are precisely the terms with a head normal form, whereas in typed作者: 灰心喪氣 時(shí)間: 2025-3-22 18:24
https://doi.org/10.1007/978-1-4612-5080-7es representing algebras . and . respectively. Any closed term of the type .. → .. represents a computable function between algebras . and .. The problem investigated in the paper is to find and characterize the set of all λ definable functions between structures . and .. The problem is presented in作者: Ligneous 時(shí)間: 2025-3-22 22:32
The Content of Computer Science,ic theories: .. The criterion is shown to be necessary in general and sufficient for languages consisting of monadic function symbols and constants. The proof is mainly based on the existence of most general solutions for solvable semi-unification problems.作者: SMART 時(shí)間: 2025-3-23 02:53 作者: 不溶解 時(shí)間: 2025-3-23 06:53 作者: 蔑視 時(shí)間: 2025-3-23 10:59 作者: addict 時(shí)間: 2025-3-23 15:19 作者: 纖細(xì) 時(shí)間: 2025-3-23 21:15
The Carolingian Debate over Sacred Spaceth the class of those sets of strings which can be defined by sentences of the form ? ., where . is first order, . is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.作者: 頌揚(yáng)本人 時(shí)間: 2025-3-24 01:19 作者: DEMUR 時(shí)間: 2025-3-24 05:43 作者: Liberate 時(shí)間: 2025-3-24 10:31 作者: Contend 時(shí)間: 2025-3-24 12:34 作者: 褲子 時(shí)間: 2025-3-24 17:43 作者: 確保 時(shí)間: 2025-3-24 22:46
978-3-540-60017-6Springer-Verlag Berlin Heidelberg 1995作者: aphasia 時(shí)間: 2025-3-25 02:54
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233770.jpg作者: excursion 時(shí)間: 2025-3-25 05:21 作者: 違抗 時(shí)間: 2025-3-25 09:42
Logics for context-free languages,th the class of those sets of strings which can be defined by sentences of the form ? ., where . is first order, . is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.作者: 長(zhǎng)處 時(shí)間: 2025-3-25 13:13
Is first order contained in an initial segment of PTIME?,ls of this signature are all in an initial segment of P is shown to be related to other intriguing open problems in complexity theory and logic, like P=P...The second part of the paper strengthens the result of Ph. Kolaitis of logical definability of unambiguous computations.作者: 蕨類 時(shí)間: 2025-3-25 17:28
Computer Science Logic978-3-540-49404-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Bumptious 時(shí)間: 2025-3-25 22:08 作者: Accolade 時(shí)間: 2025-3-26 03:35
The Carolingian Debate over Sacred Spaceth the class of those sets of strings which can be defined by sentences of the form ? ., where . is first order, . is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.作者: 舔食 時(shí)間: 2025-3-26 06:03 作者: 裂縫 時(shí)間: 2025-3-26 12:23 作者: colostrum 時(shí)間: 2025-3-26 14:47
Monadic second-order logic and linear orderings of finite structures,We consider graphs in which it is possible to specify linear orderings of the sets of vertices, in uniform ways, by MS (i.e., Monadic Second-order) formulas. We also consider classes of graphs ? such that for every L.?, L is recognizable iff it is MS-definable. Our results concern in particular dependency graphs of partially commutative words.作者: Simulate 時(shí)間: 2025-3-26 20:31 作者: 租約 時(shí)間: 2025-3-27 00:33
https://doi.org/10.1007/978-1-4612-5080-7 allows both specialization of the type of an inherited method to the type of the inheriting object and static detection of errors, such as ‘ .’. The resulting calculus is an extension of the original one. Type soundness follows from the subject reduction property.作者: 表示問(wèn) 時(shí)間: 2025-3-27 02:53 作者: 耕種 時(shí)間: 2025-3-27 08:09 作者: 名字的誤用 時(shí)間: 2025-3-27 12:54 作者: 抒情短詩(shī) 時(shí)間: 2025-3-27 16:40
Dennis J. Paulson,Austin L. Shugorder sentences of type involving only a single binary relation..We give similar results for generalized spectra and some corollaries: in particular, from the fact that the large complexity class ...(.) is included in .. for unary languages (. denotes the input integer), we deduce that the set of primes and many “natural” sets belong to ..作者: multiply 時(shí)間: 2025-3-27 18:40 作者: 大酒杯 時(shí)間: 2025-3-28 00:02
The Girard Translation extended with recursion,ogic into proofs of Intuitionistic Linear Logic given by the Girard Translation is extended with the rules for recursion such that an embedding of terms of the λ.-calculus into terms of the linear λ.-calculus is induced via the extended Curry-Howard isomorphisms. This embedding is shown to be sound with respect to the categorical interpretations.作者: 粗語(yǔ) 時(shí)間: 2025-3-28 06:02 作者: Classify 時(shí)間: 2025-3-28 07:44
How to lie without being (easily) convicted and the lengths of proofs in propositional calculus,player is trying to convict him of a lie. The second method is based on boolean valuations. For the first method, a log . + log log .(logloglog .) lower bound is given on the lengths of interactive proofs of certain permutation tautologies.作者: 拔出 時(shí)間: 2025-3-28 12:40
First-order spectra with one binary predicate,order sentences of type involving only a single binary relation..We give similar results for generalized spectra and some corollaries: in particular, from the fact that the large complexity class ...(.) is included in .. for unary languages (. denotes the input integer), we deduce that the set of primes and many “natural” sets belong to ..作者: Dri727 時(shí)間: 2025-3-28 17:37
Subtyping with singleton types,pecification {.} which is met uniquely by .. Singletons integrate abbreviational definitions into a type system: the hypothesis .: {. asserts .. The addition of singleton types is a non-conservative extension of familiar subtyping theories. In our system, more terms are typable and previously typable terms have more (non-dependent) types.作者: connoisseur 時(shí)間: 2025-3-28 18:49
,Convergence and 0–1 laws for ,, under arbitrary measures,itrary measure. We use this theorem to obtain some results about the nonexistence of .. convergence laws for particular classes of structures. We also disprove a conjecture of Tyszkiewicz [16] relating the existence of .. and MSO 0–1 laws on classes of structures with arbitrary measures.作者: 直覺(jué)沒(méi)有 時(shí)間: 2025-3-29 00:59 作者: 江湖騙子 時(shí)間: 2025-3-29 05:25
0302-9743 cal systems. Together, these papers give a representative snapshot of the area of logical foundations of computer science.978-3-540-60017-6978-3-540-49404-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 文藝 時(shí)間: 2025-3-29 08:56 作者: 雪上輕舟飛過(guò) 時(shí)間: 2025-3-29 11:54
https://doi.org/10.1007/978-3-319-58341-9and over equationally presented constraint domains as special cases. We give a categorical treatment of the fix-point semantics of Kowalski and van Emden, which establishes completeness in a very general setting.作者: laparoscopy 時(shí)間: 2025-3-29 16:23 作者: 暫時(shí)中止 時(shí)間: 2025-3-29 20:26
Logic programming in Tau Categories,and over equationally presented constraint domains as special cases. We give a categorical treatment of the fix-point semantics of Kowalski and van Emden, which establishes completeness in a very general setting.作者: Affluence 時(shí)間: 2025-3-30 02:35 作者: Overstate 時(shí)間: 2025-3-30 06:12 作者: 輕快帶來(lái)危險(xiǎn) 時(shí)間: 2025-3-30 10:16 作者: Hyperalgesia 時(shí)間: 2025-3-30 16:01
https://doi.org/10.1057/9781137295057adic second-order logic with addition captures the class NLIN, so enlarging considerably the set of natural problems expressible in this logic. Moreover, we also prove that this logic still captures NLIN even if first-order part of the second-order formulas is required to be ?.?., so improving the recent similar result of J.F.Lynch about NTIME(.).作者: 星星 時(shí)間: 2025-3-30 18:44 作者: ONYM 時(shí)間: 2025-3-30 23:30 作者: Individual 時(shí)間: 2025-3-31 01:42 作者: 啟發(fā) 時(shí)間: 2025-3-31 06:41 作者: crescendo 時(shí)間: 2025-3-31 10:52 作者: GOAT 時(shí)間: 2025-3-31 16:08
https://doi.org/10.1007/978-1-4612-5080-7fective computational characteristic of the λ definable functions between arbitrary free algebras and the expressiveness of such transformations. As an example we will consider λ definability between well known free structures such as: numbers, words and trees. The result obtained in the paper is an作者: nuclear-tests 時(shí)間: 2025-3-31 19:37 作者: 積云 時(shí)間: 2025-3-31 22:44 作者: 口味 時(shí)間: 2025-4-1 05:45
Lambda representation of operations between different term algebras,fective computational characteristic of the λ definable functions between arbitrary free algebras and the expressiveness of such transformations. As an example we will consider λ definability between well known free structures such as: numbers, words and trees. The result obtained in the paper is an作者: 欺騙手段 時(shí)間: 2025-4-1 09:21 作者: monologue 時(shí)間: 2025-4-1 12:02 作者: Herbivorous 時(shí)間: 2025-4-1 17:07
A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects,he possibility of having a restricted form of . subtyping and the features of the delegation-based language itself. The original type inference system allows both specialization of the type of an inherited method to the type of the inheriting object and static detection of errors, such as ‘ .’. The 作者: ENDOW 時(shí)間: 2025-4-1 21:58 作者: SOBER 時(shí)間: 2025-4-1 23:37
