The data type variety of stack algebras-Reference-Cited by-同舟云学术

The data type variety of stack algebras

Published:1995-05 Issue:1 Volume:73 Page:11-36
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Bergstra J.A,Tucker J.V

Publisher

Elsevier BV

Subject

Logic

Reference27 articles.

1. Algebraic specifications of computable and semicomputable data structures;Bergstra;Mathematical Centre, Department of Computer Science, Research Report IW 115/79,1979

2. A natural data type with a finite equational final semantics specification, but no effective equational initial specification;Bergstra;Bull. EATCS,1980

3. A characterisation of computable data types by means of a finite equational specification method;Bergstra,1980

4. Initial and final algebra semantics for data type specifications: two characterisation theorems;Bergstra;SIAM J. Comput.,1983

5. The completeness of the algebraic specification methods for computable data types;Bergstra;Inform. and Control,1983

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On system rollback and totalized fields;The Journal of Logic and Algebraic Programming;2011-11

2. Division Safe Calculation in Totalised Fields;Theory of Computing Systems;2007-07-26

3. Elementary Algebraic Specifications of the Rational Function Field;Logical Approaches to Computational Barriers;2006

4. Elementary Algebraic Specifications of the Rational Complex Numbers;Algebra, Meaning, and Computation;2006

5. 2004 Summer Meeting of the Association for Symbolic Logic;Bulletin of Symbolic Logic;2005-06