scientific article; zbMATH DE number 176725

MaRDI QIDQ4036554zbMATH OpenFDO

Authors Val Breazu-Tannen, Ramesh Subrahmanyam

Publication date 18 May 1993

zbMATH Keywords

back-and-forth translationsbagsdeterministic and terminating evaluatorlistslogic for reasoning about the definedness of termsprogramming with primitive recursion over non-free datatypesrecursion free programsset-theoretic denotational semantics with partial functionssets

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4016167
• Logic Programs for Primitive Recursive Sets
• scientific article; zbMATH DE number 1140684
• Calculability and logic programs
• Logical foundations for programming semantics

Cited in

(16)

• Verifiable properties of database transactions
• Relational programming laws in the tree, list, bag, set hierarchy
• Query languages for bags and aggregate functions
• A query language for NC
• Models of approximation in databases
• Domain-independent queries on databases with external functions
• An algebra for pomsets.
• Bag equivalence via a proof-relevant membership relation
• scientific article; zbMATH DE number 3845031 (Why is no real title available?)
• Push versus pull-based loop fusion in query engines
• An analysis of the Core-ML language: Expressive power and type reconstruction
• scientific article; zbMATH DE number 2090024 (Why is no real title available?)
• A generic algebra for data collections based on constructive logic
• On the theory of bags and lists
• A query language for NC (extended abstract)
• Principles of programming with complex objects and collection types

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036554)