Algebras, polynomials and programs

DOI10.1016/0304-3975(90)90150-GzbMATH Open0726.68055MaRDI QIDQ802882FDOQ802882

Authors: Eric G. Wagner 

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Polynomial algorithms in computer algebra
• Computer algebra and polynomials. Applications of algebra and number theory
• scientific article; zbMATH DE number 7779293
• Computation in polynomial algebras and ideals
• scientific article; zbMATH DE number 517393
• scientific article; zbMATH DE number 977284
• scientific article; zbMATH DE number 4110824

zbMATH Keywords

substitutioniterationpolynomialsrecursionapplications of ideas from universal algebra and category theory to the definition and semantics of programming languagesflowchart program semanticsformal equationsLawvere algebraic theoriesmany-sorted universal algebrasrecursive program semantics

Mathematics Subject Classification ID

Theories (e.g., algebraic theories), structure, and semantics (18C10) Semantics in the theory of computing (68Q55) Applications of universal algebra in computer science (08A70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Canonical constraints for parameterized data types
• Title not available (Why is that?)
• Recursion and iteration in continuous theories: the M-construction
• Title not available (Why is that?)

Cited In (18)

• Computer algebra and polynomials. Applications of algebra and number theory
• Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
• Full abstraction and recursion
• Algebra. Polynomials, Galois theory and applications in informatics. Course and corrected exercises
• Universal algebra in higher types
• Title not available (Why is that?)
• Towards a calculus of algorithms
• Categorial generalization of algebraic recursion theory
• Polynomial algorithms in computer algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topology, domain theory and theoretical computer science
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic polymorphisms
• Computation in polynomial algebras and ideals

This page was built for publication: Algebras, polynomials and programs

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