Can programming be liberated from the von Neumann style?
From MaRDI portal
Publication:4162630
DOI10.1145/359576.359579zbMath0383.68013OpenAlexW2172307690WikidataQ55871509 ScholiaQ55871509MaRDI QIDQ4162630
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359576.359579
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items
Relational algebraic semantics of deterministic and nondeterministic programs, Generic recursive lens combinators and their calculation laws, Modelling the combination of functional and logic programming languages, Structured algebraic specifications: A kernel language, A theory for nondeterminism, parallelism, communication, and concurrency, On the creation of a macromodel of social development, Syntactic properties of the refal language, Algebraic specification and proof of a distributed recovery algorithm, Semantics of finite and infinite networks of concurrent communicating agents, Routines: An argument against the conventional approach to functions and procedures, Proof versus formalization, On flowchart theories. I. The deterministic case, An algebraic approach to semantics of programming languages, Two-level semantics and code generation, Cartesian Monoids, Assignment Calculus: A Pure Imperative Language, Random number generators for large-scale parallel Monte Carlo simulations on FPGA, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Functional programming with combinators, CoLab: A hybrid knowledge representation and compilation laboratory, Purposive discovery of operators, Formalized program specifications and transformation synthesis, Action Semantics in Retrospect, Recursion Equations as a Programming Language, Nominative data with ordered set of names, An object-oriented deductive language, Parallel scheduling of recursively defined arrays, Basic paradigms of programming, Parallelization of divide-and-conquer in the Bird-Meertens formalism, Program testing: Specification languages and automatic test generation, Finite generation of ambiguity in context-free languages, Undecidable complexity statements in -arithmetic, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Skeleton-based parallel programming: functional and parallel semantics in a single shot, An introduction to Landin's ``Getting rid of labels, Finite approximations to infinite series, Computation on graph-like expressions, The definition of Extended ML: A gentle introduction, Drill and Join: A Method for Exact Inductive Program Synthesis, Partially additive categories and flow-diagram semantics, Pointfree expression and calculation: From quantification to temporal logic, Multiple data structuring, Sequence recursiveness without cylindrification and limited register machines, The independence of control structures in abstract programming systems, Issues in the design of a parallel object-oriented language, Two-level semantics and abstract interpretation, An efficient interpreter for the lambda-calculus, A reification calculus for model-oriented software specification, A category-theoretic characterization of functional completeness, Implementing term rewrite languages in DACTL, A note on the existence of continuous functionals, The applicative data model, High-level Petri-net model for a resource-sharing problem, Graph grammars and operational semantics, On the expansion of non-linear functions, Genome as a functional program, Relation algebraic domain constructions, Unnamed Item, Can a Quantum Computer Run the von Neumann Architecture?, A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem, A new approach to recursion removal, The data model of FAD, a database programming language, Predicate transformers and higher-order programs, Is genome written in Haskell?, NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS, Quantum programming languages: a tentative study, Algebraic optimization of object-oriented query languages, Declarative operations on nets, Calculate categorically!, fsh—A functional unix command interpreter, On the synthesis of function inverses, Transformation of structure-shy programs with application to XPath queries and strategic functions, Matrix representable so-rings, A glimpse into the paradise of combinatory algebra, Functional parallel typified language and its implementation on clusters, A knowledge-based approach to program synthesis from examples, Efficient memo-table management strategies, Relation algebra as programming language using the Ampersand compiler, Towards massively parallel computations in algebraic geometry, Algebraic languages for mathematical programming, Term-rewriting systems with rule priorities, A high-level dataflow system, A functional programming-directed database machine, Inverse image analysis generalises strictness analysis, Program transformation by solving equations, Semantics of algorithmic languages, Learning problem for functional programming and model of biological evolution, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Some FP algebra with currying operation, Correctness of recursive parallel nondeterministic flow programs, π-RED+ An interactive compiling graph reduction system for an applied λ-calculus, Foundations of programmology, Tensor product of partially-additive monoids, The inverse semigroup of a sum-ordered semiring, Propositions and specifications of programs in Martin-Löf's type theory, Acceptable functional programming systems, An applicative random-access stack, On a generalized product for domains, Yacc in sasl — an exercise in functional programming, Parallel solution of recurrences on a tree machine, FPL : Functional plus logic programming an integration of the FP and Prolog languages, Software Development in Relation Algebra with Ampersand, A local termination property for term rewriting systems, Introducing data types in intuitionistic type theory, Automatic verification of functional programs, The ins and outs of Clean I/O, Lightweight Memristive Neural Network for Gas Classification Based on Heterogeneous Strategy, A matching process modulo a theory of categorical products, A decade of TAPSOFT, Denotational semantics as a foundation for cost recurrence extraction for functional languages, Recursive solution of initial value problems with temporal discretization, Category theory and theory of evolution, Algebraic and Logical Operations on Operators One Application to Semantic Computation, Space-efficient functional offline-partially-persistent trees with applications to planar point location, Composition aspects of programmology. I, Unnamed Item, Proposal for a natural formalization of functional programming concepts, STICK: Spike Time Interval Computational Kernel, a Framework for General Purpose Computation Using Neurons, Precise Timing, Delays, and Synchrony, Efficient Associative Computation with Discrete Synapses, A note on recursive functions, Primitive program algebras of computable functions, The Impact of the Lambda Calculus in Logic and Computer Science, Logic and functional programming by retractions, A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA., Algebraic Specialization of Generic Functions for Recursive Types, Constraint-aware Schema Transformation, Mutual derivability of operations in program algebras. I, Using transformations in the implementation of higher-order functions, Extended Static Checking by Calculation Using the Pointfree Transform, Unnamed Item, Unnamed Item, Denotation by Transformation, Concepts and realization of a high-performance data type architecture, Definition of the semantics of programming language constructs in terms of ?-calculus. I
