Higher-Order and Symbolic Computation
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Linearity and iterator types for Gödel’s System
Higher-Order and Symbolic Computation - Tập 23 - Trang 1-27 - 2010
System
is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of Gödel’s System
. System
......
An Introduction to Landin's “A Generalization of Jumps and Labels”
Higher-Order and Symbolic Computation - Tập 11 - Trang 117-123 - 1998
This note introduces Peter Landin's 1965 technical report “A Generalization of Jumps and Labels”, which is reprinted in this volume. Its aim is to make that historic paper more accessible to the reader and to help reading it in context. To this end, we explain Landin's control operator J in more contemporary terms, and we recall Burge's solution to a technical problem in Landin's original account.
On the correctness of the Krivine machine
Higher-Order and Symbolic Computation - Tập 20 - Trang 231-235 - 2007
We provide a short proof of the correctness of the Krivine machine by showing how it simulates weak head reduction.
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct
Higher-Order and Symbolic Computation - Tập 18 - Trang 299-326 - 2005
A Scheme letrec expression is easily converted into more primitive constructs via a straightforward transformation given in the Revised5 Report. This transformation, unfortunately, introduces assignments that can impede the generation of efficient code. This article presents a more judicious transformation that preserves the semantics of the revised report transformation and also detects invalid r......
A Generalization of Jumps and Labels
Higher-Order and Symbolic Computation - Tập 11 - Trang 125-143 - 1998
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional labels and jumping as a special, but probably not most useful, case. It is independent of assignment, ie., it can be added to a “purely-functional” (“non-imperative”) system (such as LISP without pseudo-functions or progra......
Continuation-Based Multiprocessing Revisited
Higher-Order and Symbolic Computation - Tập 12 - Trang 283-283 - 1999
A Variadic Extension of Curry's Fixed-Point Combinator
Higher-Order and Symbolic Computation - Tập 18 - Trang 371-388 - 2005
We present a systematic construction of a variadic, applicative-order, multiple fixed-point combinator in Scheme. The resulting Scheme procedure is a variadic extension of the n-ary version of Curry's fixed-point combinator. It can be used to create mutually-recursive procedures, and expand letrec-expressions.
Implementing Metcast in Scheme
Higher-Order and Symbolic Computation - Tập 18 - Trang 355-370 - 2005
This paper describes the experience of implementing a core component of an operationally deployed large distributed system in Scheme. Metcast is a request-reply and subscription system for the dissemination of real-time weather information. The system stores vast amounts of weather observation reports, forecasts, gridded data produced by weather models, and satellite imagery. A Metcast server deli......
Continuation-Based Multiprocessing
Higher-Order and Symbolic Computation - - 1999
Any multiprocessing facility must include three features: elementary exclusion, data protection, and process saving. While elementary exclusion must rest on some hardware facility (e.g., a test-and-set instruction), the other two requirements are fulfilled by features already present in applicative languages. Data protection may be obtained through the use of procedures (closures or funargs), and ......
Tổng số: 267
- 1
- 2
- 3
- 4
- 5
- 6
- 10