Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
type: Item
instance of: scholarly article
title: Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
zbMATH Open document ID: 0641.68025
DOI: 10.1016/S0747-7171(87)80066-4
author: B. George
published in: Journal of Symbolic Computation
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 4045110
zbMATH Keywords: mechanical translation
zbMATH Keywords: automatic top-down approach to program development
zbMATH Keywords: formal problem specification
zbMATH Keywords: fixed point iteration
zbMATH Keywords: finite differencing
zbMATH Keywords: data structure selection
zbMATH Keywords: transformational programming system
zbMATH Keywords: attribute closure
zbMATH Keywords: relational databases
zbMATH Keywords: linear time solution
describes a project that uses: SETL
describes a project that uses: MACSYMA
describes a project that uses: REVE
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4050122
cites work: Proofs as programs
cites work: Q3947094
cites work: Q3731007
cites work: The promotion and accumulation strategies in transformational programming
cites work: A Transformation System for Developing Recursive Programs
cites work: A relational model of data for large shared data banks
cites work: Computer-assisted microanalysis of programs
cites work: Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
cites work: Q4144755
cites work: High level iterators and a method for automatically designing data structure representation
cites work: Q5584402
cites work: Experience with the SETL Optimizer
cites work: Q4134899
cites work: Q5656731
cites work: Q4186267
cites work: Q3758820
cites work: Abstract data types and software validation
cites work: An axiomatic basis for computer programming
cites work: Programming with Equations
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q3922128
cites work: Q5585020
cites work: Q5581665
cites work: Q4051550
cites work: Program Improvement by Source-to-Source Transformation
cites work: A Deductive Approach to Program Synthesis
cites work: Q4195960
cites work: Q3339273
cites work: Q3700872
cites work: Finite Differencing of Computable Expressions
cites work: A linear time solution to the single function coarsest partition problem
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: An Automatic Technique for Selection of Data Representations in SETL Programs
cites work: Automatic data structure choice in a language of very high level
cites work: Q3741005
cites work: Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
cites work: Q5686039
cites work: Amortized Computational Complexity
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: Q3206351
cites work: Program development by stepwise refinement
full work available at URL: s0747-7171(87)80066-4
OpenAlex ID: W2110272713
description: scientific article; zbMATH DE number 4045110