Higher-Order and Symbolic Computation

SCOPUS (1996-2013)

  1573-0557

  1388-3690

 

 

Cơ quản chủ quản:  N/A

Phân tích ảnh hưởng

Các bài báo tiêu biểu

State in Haskell
Tập 8 Số 4 - Trang 293-341 - 1995
John Launchbury, Simon L. Peyton Jones
Syntactic abstraction in scheme
- 1993
R. Kent Dybvig, Robert Hieb, Carl Bruggeman
A runtime system
- 1990
Andrew W. Appel
The VLISP verified Scheme system
- 1995
Joshua D. Guttman, John D. Ramsdell, Vipin Swarup
Endpaper: Technical issues of separation in function cells and value cells
Tập 1 Số 1 - Trang 81-101 - 1988
Richard P. Gabriel, Kent M. Pitman
Shortcut fusion rules for the derivation of circular and higher-order programs
Tập 24 Số 1-2 - Trang 115-149 - 2011
Alberto Pardo, João Paulo Fernandes, João Saraiva
Continuation-Passing C, compiling threads to events through continuations
- 2011
Gabriel Kerneis, Juliusz Chroboczek
Partial Evaluation of the Euclidian Algorithm
Tập 10 - Trang 101-111 - 1997
Olivier Danvy, Mayer Goldberg
Some programs are easily amenable to partial evaluation because their control flow clearly depends on one of their parameters. Specializing such programs with respect to this parameter eliminates the associated interpretive overhead. Some other programs, however, do not exhibit this interpreter-like behavior. Each of them presents a challenge for partial evaluation. The Euclidian algorithm is one ... hiện toàn bộ