Pages that link to "Item:Q4162630"

The following pages link to Can programming be liberated from the von Neumann style? (Q4162630):

Displaying 50 items.

• Transformation of structure-shy programs with application to XPath queries and strategic functions (Q532417) (← links)
• Efficient memo-table management strategies (Q582879) (← links)
• An introduction to Landin's ``Getting rid of labels'' (Q604862) (← links)
• Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
• Predicate transformers and higher-order programs (Q672318) (← links)
• Algebraic optimization of object-oriented query languages (Q688667) (← links)
• A functional programming-directed database machine (Q750140) (← links)
• Inverse image analysis generalises strictness analysis (Q751835) (← links)
• Program transformation by solving equations (Q756436) (← links)
• Semantics of algorithmic languages (Q760200) (← links)
• Learning problem for functional programming and model of biological evolution (Q779745) (← links)
• Some FP algebra with currying operation (Q789160) (← links)
• Correctness of recursive parallel nondeterministic flow programs (Q789165) (← links)
• The inverse semigroup of a sum-ordered semiring (Q800396) (← links)
• Propositions and specifications of programs in Martin-Löf's type theory (Q800719) (← links)
• Skeleton-based parallel programming: functional and parallel semantics in a single shot (Q875962) (← links)
• Issues in the design of a parallel object-oriented language (Q909434) (← links)
• Two-level semantics and abstract interpretation (Q911319) (← links)
• A reification calculus for model-oriented software specification (Q911753) (← links)
• A category-theoretic characterization of functional completeness (Q912587) (← links)
• Implementing term rewrite languages in DACTL (Q912591) (← links)
• The applicative data model (Q918678) (← links)
• High-level Petri-net model for a resource-sharing problem (Q918729) (← links)
• Quantum programming languages: a tentative study (Q954406) (← links)
• Tensor product of partially-additive monoids (Q1057976) (← links)
• Acceptable functional programming systems (Q1061487) (← links)
• An applicative random-access stack (Q1062446) (← links)
• Relational algebraic semantics of deterministic and nondeterministic programs (Q1079010) (← links)
• Modelling the combination of functional and logic programming languages (Q1079941) (← links)
• Structured algebraic specifications: A kernel language (Q1080652) (← links)
• A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
• Algebraic specification and proof of a distributed recovery algorithm (Q1090102) (← links)
• Semantics of finite and infinite networks of concurrent communicating agents (Q1090105) (← links)
• On flowchart theories. I. The deterministic case (Q1093364) (← links)
• Two-level semantics and code generation (Q1095636) (← links)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
• Functional programming with combinators (Q1098628) (← links)
• Parallel scheduling of recursively defined arrays (Q1106656) (← links)
• Finite generation of ambiguity in context-free languages (Q1117043) (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
• Computation on graph-like expressions (Q1134513) (← links)
• Partially additive categories and flow-diagram semantics (Q1137858) (← links)
• Sequence recursiveness without cylindrification and limited register machines (Q1154263) (← links)
• The independence of control structures in abstract programming systems (Q1155949) (← links)
• An efficient interpreter for the lambda-calculus (Q1158139) (← links)
• A note on the existence of continuous functionals (Q1162153) (← links)
• Graph grammars and operational semantics (Q1165029) (← links)
• On the expansion of non-linear functions (Q1175710) (← links)
• Relation algebraic domain constructions (Q1177156) (← links)
• A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem (Q1185009) (← links)