作者: archenemy 時間: 2025-3-21 23:08 作者: 吞沒 時間: 2025-3-22 04:13 作者: expire 時間: 2025-3-22 04:34 作者: Ballad 時間: 2025-3-22 12:27
0302-9743 g H: Semantics-based optimization I: Domain theory and real number computation These themes were identi?ed as promising for pro?table interaction between semantic theory and practice, and were 978-3-540-44044-4978-3-540-45699-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ventilator 時間: 2025-3-22 13:20 作者: flammable 時間: 2025-3-22 17:15 作者: 上腭 時間: 2025-3-22 23:31 作者: BRAWL 時間: 2025-3-23 02:52
Gerhard Eschelbeck,Christian Hartlnalysis..We present here precise theorems, that should hopefully help the reader to understand to which extent statements like “introducing dependent types in a programming language implies that type checking is undecidable”, are justified.作者: enchant 時間: 2025-3-23 07:41
P. H. Osanna,D. Prostrednik,A. Osanna notion of binding time, and explain the method of type-directed partial evaluation for a small PCF-style functional programming language. We give algorithms for both call-by-name and call-by-value versions of this language.作者: 拔出 時間: 2025-3-23 10:27
Nikos Katsifarakis,Kostas Karatzashe ML family of programming languages, concentrating on functions involving local state. A brief tour of structural operational semantics culminates in a structural definition of termination via an abstract machine using ‘frame stacks’. Applications of this to reasoning about contextual equivalence are given.作者: spondylosis 時間: 2025-3-23 16:32
An Introduction to Dependent Type Theory,nalysis..We present here precise theorems, that should hopefully help the reader to understand to which extent statements like “introducing dependent types in a programming language implies that type checking is undecidable”, are justified.作者: Ossification 時間: 2025-3-23 20:06 作者: Solace 時間: 2025-3-23 22:41 作者: GLOOM 時間: 2025-3-24 04:09 作者: 圓柱 時間: 2025-3-24 09:30
Abstract Machines, Control, and Sequents,term). Evaluation, viewed logically, is cut-elimination: this is the essence of the so-called Curry-Howard isomorphism. Control operators correspond to classical reasoning principles, as was first observed by Griffin.作者: Commentary 時間: 2025-3-24 12:52
Computing with Real Numbers, LFT application is that of multiplying .-bit integers. In Part II, we present an accessible account of a domain-theoretic approach to computational geometry and solid modelling which provides a data-type for designing robust geometric algorithms, illustrated here by the convex hull algorithm.作者: FAWN 時間: 2025-3-24 18:15 作者: neoplasm 時間: 2025-3-24 20:30 作者: 饑荒 時間: 2025-3-25 00:04 作者: Malfunction 時間: 2025-3-25 03:28
An Introduction to Dependent Type Theory,iformly in the framework of dependent types, in which types may depend on values. The purpose of this chapter is to give some background for such an analysis..We present here precise theorems, that should hopefully help the reader to understand to which extent statements like “introducing dependent 作者: canvass 時間: 2025-3-25 09:14
Monads and Effects,on the other. The introduction of monads has made a large step towards reconciling these alternatives. First proposed by Moggi as a way of structuring semantic descriptions, they were adopted by Wadler to structure Haskell programs. Monads have been used to solve long-standing problems such as addin作者: Indolent 時間: 2025-3-25 15:01 作者: Rotator-Cuff 時間: 2025-3-25 19:35
Normalization and Partial Evaluation,atory version of G?del System T. Then we show normalization by evaluation for typed lambda calculus with . and . conversion. Finally, we introduce the notion of binding time, and explain the method of type-directed partial evaluation for a small PCF-style functional programming language. We give alg作者: 高爾夫 時間: 2025-3-25 21:36 作者: 或者發(fā)神韻 時間: 2025-3-26 00:12 作者: 淺灘 時間: 2025-3-26 07:09 作者: 避開 時間: 2025-3-26 11:47 作者: 歡樂東方 時間: 2025-3-26 16:22 作者: 漫步 時間: 2025-3-26 20:43 作者: Constant 時間: 2025-3-27 00:25 作者: otic-capsule 時間: 2025-3-27 04:07
Gilles Barthe,Peter Dybjer,Jo?o SaraivaIncludes supplementary material: 作者: Delude 時間: 2025-3-27 09:15
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160130.jpg作者: inflate 時間: 2025-3-27 09:54
Gerhard Eschelbeck,Christian Hartliformly in the framework of dependent types, in which types may depend on values. The purpose of this chapter is to give some background for such an analysis..We present here precise theorems, that should hopefully help the reader to understand to which extent statements like “introducing dependent 作者: Cupidity 時間: 2025-3-27 16:49
https://doi.org/10.1007/978-0-387-34951-0on the other. The introduction of monads has made a large step towards reconciling these alternatives. First proposed by Moggi as a way of structuring semantic descriptions, they were adopted by Wadler to structure Haskell programs. Monads have been used to solve long-standing problems such as addin作者: epicardium 時間: 2025-3-27 18:56
Ralf Denzer,Gerald Schimak,David Russelllanguage. Then we add a simple control operator and extend the abstract machines accordingly. We give some examples of their use. Then, restricting our attention to the sole core (typed) λ-calculus fragment augmented with the control operator, we give a logical status to the machinery. Evaluation co作者: 訓(xùn)誡 時間: 2025-3-28 00:09
P. H. Osanna,D. Prostrednik,A. Osannaatory version of G?del System T. Then we show normalization by evaluation for typed lambda calculus with . and . conversion. Finally, we introduce the notion of binding time, and explain the method of type-directed partial evaluation for a small PCF-style functional programming language. We give alg作者: Flatter 時間: 2025-3-28 05:54
Ji?í H?ebí?ek,Ralf Denzer,Tomá? Pitnerinite stream of signed digits, based on the interval [?1,1]. Numerical operations are implemented in terms of . (LFT’s). We derive lower and upper bounds for the number of argument digits that are needed to obtain a desired number of result digits of a computation, which imply that the complexity of作者: insomnia 時間: 2025-3-28 09:39
https://doi.org/10.1007/978-3-319-89935-0buted and mobile programming. It is characterized by an explicit notion of locality, a strict adherence to local synchronization, and a direct embedding of the ML programming language. The join calculus is used as the basis for several distributed languages and implementations, such as JoCaml and fu作者: 斑駁 時間: 2025-3-28 13:03
Ji?í H?ebí?ek,Ralf Denzer,Tomá? Pitnerical foundation in Join calculus. This paper gives an overview of functional nets as a kernel programming language, it presents an object-based version of Join calculus, and it shows how the two relate.作者: packet 時間: 2025-3-28 17:28
Nikos Katsifarakis,Kostas Karatzastion which is very useful for reasoning about operational equivalence of programs. We restrict attention to contextual equivalence of expressions in the ML family of programming languages, concentrating on functions involving local state. A brief tour of structural operational semantics culminates i作者: 人類學(xué)家 時間: 2025-3-28 19:17 作者: 讓你明白 時間: 2025-3-29 00:19
Applied Semantics978-3-540-45699-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
