AbstractThis paper presents the prototype design of an algebraic computation system that manipulates algebraic quantities as generic objects using order-sorted algebra as the underlying model. The resulting programs have a form that is closely related to the algorithmic description of a problem, but with the security of full type checking in a compact, natural style
This paper considers a programming language where all control is encoded in algebras and combinators...
8 pages, 2-column presentation, 2 figuresSo far, the scope of computer algebra has been needlessly r...
An algebraic programming system is a language built from a fixed algebraic data abstraction and a se...
AbstractThis paper presents the prototype design of an algebraic computation system that manipulates...
Algebraic structures are a concept from mathematics to bring sets and their operations together. Thi...
An important feature of modern computer algebra systems is the support of a rich type system with th...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
It is widely recognized that programming languages should offer features to help structure programs....
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study...
AbstractStructured data are generally composed from constituent parts by constructors and decomposed...
The purpose of the article is to analyze the known methods of ordering in computer science. The res...
A generalization of many-sorted algebras, called category-sorted algebras, is defined and applied to...
AbstractWe investigate parametrization for order-sorted algebraic specifications. As a prerequisite ...
Although scientific computing is very often associated with numeric computations, the use of compute...
Our purpose is to formalize two potential refinements of single-sorted algebraic data types – subalg...
This paper considers a programming language where all control is encoded in algebras and combinators...
8 pages, 2-column presentation, 2 figuresSo far, the scope of computer algebra has been needlessly r...
An algebraic programming system is a language built from a fixed algebraic data abstraction and a se...
AbstractThis paper presents the prototype design of an algebraic computation system that manipulates...
Algebraic structures are a concept from mathematics to bring sets and their operations together. Thi...
An important feature of modern computer algebra systems is the support of a rich type system with th...
We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds...
It is widely recognized that programming languages should offer features to help structure programs....
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study...
AbstractStructured data are generally composed from constituent parts by constructors and decomposed...
The purpose of the article is to analyze the known methods of ordering in computer science. The res...
A generalization of many-sorted algebras, called category-sorted algebras, is defined and applied to...
AbstractWe investigate parametrization for order-sorted algebraic specifications. As a prerequisite ...
Although scientific computing is very often associated with numeric computations, the use of compute...
Our purpose is to formalize two potential refinements of single-sorted algebraic data types – subalg...
This paper considers a programming language where all control is encoded in algebras and combinators...
8 pages, 2-column presentation, 2 figuresSo far, the scope of computer algebra has been needlessly r...
An algebraic programming system is a language built from a fixed algebraic data abstraction and a se...
DOI
Add to ORKG