Pages that link to "Item:Q5345264"

The following pages link to Correspondence between ALGOL 60 and Church's Lambda-notation (Q5345264):

Displaying 47 items.

• An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
• A survey of state vectors (Q458456) (← links)
• VDM semantics of programming languages: Combinators and monads (Q539163) (← links)
• Computational interpretations of linear logic (Q685430) (← links)
• The semantics of second-order lambda calculus (Q751294) (← links)
• Expressive power of typed and type-free programming languages (Q761790) (← links)
• Peter J. Landin (1930--2009) (Q848746) (← links)
• A functional computation model for the duality of two-variable lambda-Boolean functions (Q861192) (← links)
• A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
• A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
• Hierarchical development of programming languages (Q1161053) (← links)
• The IO- and OI-hierarchies (Q1161273) (← links)
• A theory for program and data type specification (Q1199933) (← links)
• On procedures as open subroutines. II (Q1216944) (← links)
• SEMANOL (73), a metalanguage for programming the semantics of programming languages (Q1219158) (← links)
• Call-by-name, call-by-value and the \(\lambda\)-calculus (Q1225449) (← links)
• Output driven interpretation of recursive programs, or writing creates and destroys data structures (Q1238624) (← links)
• A syntactic theory of sequential state (Q1263961) (← links)
• Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
• On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
• Locally complete consistent F-augmented contexts: a category-theoretic representation of algebraic L-domains (Q1800385) (← links)
• Higher-order substitutions (Q1854398) (← links)
• The origins of structural operational semantics (Q1878710) (← links)
• Continuation-passing C, compiling threads to events through continuations (Q1929338) (← links)
• Meaning and computing: two approaches to computable propositions (Q2148782) (← links)
• An empirical study of on-line models for relational data streams (Q2361576) (← links)
• The lambda-gamma calculus: A language adequate for defining recursive functions (Q2542069) (← links)
• Quantitative fuzzy semantics (Q2546503) (← links)
• Program proving: KJumps and functions (Q2550288) (← links)
• Pair grammars, graph languages and string-to-graph translations (Q2550295) (← links)
• On the complexity of stream equality (Q2875229) (← links)
• A Linear First-Order Functional Intermediate Language for Verified Compilers (Q2945646) (← links)
• Fortifying macros (Q3165523) (← links)
• A glimpse into the paradise of combinatory algebra (Q3343428) (← links)
• (Q3858241) (← links)
• (Q3890661) (← links)
• (Q3910511) (← links)
• (Q4171548) (← links)
• A CUCH-machine: The automatic treatment of bound variables (Q4403722) (← links)
• A category theory for programming languages (Q4772150) (← links)
• Polymorphic programming I. Another language designed on semantic principles (Q5186706) (← links)
• Head reduction and normalization in a call-by-value lambda-calculus (Q5240183) (← links)
• Semantics of context-free languages (Q5555691) (← links)
• A categorical interpretation of Landin's correspondence principle (Q5890068) (← links)
• Language transformations in the classroom (Q6643747) (← links)