Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Higher-order programming 19 found (28 total)

alternate case: higher-order programming

Control-flow analysis (264 words) [view diff] exact match in snippet view article find links to article

of function or method calls in computer programs written in a higher-order programming language.[dubious – discuss] For example, in a programming language
Defunctionalization (640 words) [view diff] case mismatch in snippet view article find links to article
C. Reynolds in his 1972 paper, "Definitional Interpreters for Higher-Order Programming Languages". Reynolds' observation was that a given program contains
OBJ (programming language) (235 words) [view diff] case mismatch in snippet view article
A. Goguen, Higher-Order Functions Considered Unnecessary for Higher-Order Programming. In Research Topics in Functional Programming (June 1990). pp.
Matthias Felleisen (492 words) [view diff] case mismatch in snippet view article find links to article
of Lambda_v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages Doctoral advisor Daniel P. Friedman
CEK Machine (1,845 words) [view diff] case mismatch in snippet view article find links to article
John Reynolds's Interpreter III in "Definitional Interpreters for Higher-Order Programming Languages". To wit, here is an implementation of the CEK machine
Currying (5,025 words) [view diff] exact match in snippet view article find links to article
Reynolds, John C. (1 August 1972). "Definitional interpreters for higher-order programming languages". In Shields, Rosemary (ed.). Proceedings of the ACM
History of the Scheme programming language (2,021 words) [view diff] no match in snippet view article find links to article
2018-06-25. Reynolds, John (1972). "Definitional interpreters for higher order programming languages". ACM Conference Proceedings. Association for Computing
Continuation (3,043 words) [view diff] case mismatch in snippet view article find links to article
P. Wadsworth. John C. Reynolds. Definitional Interpreters for Higher-Order Programming Languages Proceedings of 25th ACM National Conference, pp. 717–740
Computable number (3,269 words) [view diff] no match in snippet view article find links to article
Michael J. (8 August 1986). "Exact real arithmetic: A case study in higher order programming" (PDF). Proceedings of the 1986 ACM conference on LISP and functional
Moses Schönfinkel (945 words) [view diff] case mismatch in snippet view article find links to article
S2CID 119004002. Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4): 374
Operational semantics (2,565 words) [view diff] exact match in snippet view article find links to article
conversion: a syntactic theory of control and state in imperative higher-order programming languages (PDF) (PhD). Indiana University. Retrieved July 22, 2021
Mutual recursion (2,013 words) [view diff] case mismatch in snippet view article find links to article
(1993) Reynolds, John (August 1972). "Definitional Interpreters for Higher-Order Programming Languages" (PDF). Proceedings of the ACM Annual Conference. Boston
Meta-circular evaluator (1,945 words) [view diff] case mismatch in snippet view article find links to article
compiler Reynolds, John C. (1972). "Definitional Interpreters for Higher-Order Programming Languages". Proceedings of the ACM annual conference on - ACM '72
List of programming languages by type (6,703 words) [view diff] exact match in snippet view article find links to article
language featuring polymorphic typing, modular programming, and higher-order programming) Oz, and Mozart Programming System cross-platform Oz Prolog (formulates
Function object (4,383 words) [view diff] exact match in snippet view article find links to article
makes closures even simpler, and Scheme code tends to use such higher-order programming somewhat more idiomatically. (define (make-counter value) (lambda
Delimited continuation (2,279 words) [view diff] case mismatch in snippet view article find links to article
Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages (PDF) (Thesis). Sitaram, Dorai; Felleisen, Matthias (1990)
Actor model and process calculi history (2,420 words) [view diff] exact match in snippet view article find links to article
ECOOP 91. Benjamin Pierce, Didier Rémy and David Turner. A typed higher-order programming language based on the pi-calculus Workshop on type Theory and its
Actor model and process calculi (3,220 words) [view diff] exact match in snippet view article find links to article
1992. Benjamin Pierce, Didier Rémy and David Turner. A typed higher-order programming language based on the pi-calculus Workshop on type Theory and its
Julia Lawall (490 words) [view diff] case mismatch in snippet view article find links to article
Her dissertation, Continuation Introduction and Elimination in Higher-Order Programming Languages, was jointly supervised by Daniel P. Friedman and Olivier