language:
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 languageDefunctionalization (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 containsOBJ (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. FriedmanCEK Machine (1,870 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 machineCurrying (5,036 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 ACMContinuation (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–740Computable number (3,270 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 functionalHistory of the Scheme programming language (2,040 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 ComputingMoses 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): 374Mutual recursion (2,015 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. BostonOperational 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, 2021Meta-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 '72List of programming languages by type (6,710 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 (formulatesFunction 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) (lambdaActor 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 itsDelimited 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 (3,252 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 itsJulia 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