1174 search results - page 47 / 235 » A Logical Approach to Abstract Algebra |
FASE
2000
Springer
14 years 1 months ago
2000
Springer
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
TLCA
2009
Springer
14 years 4 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
CALCO
2007
Springer
14 years 4 months ago
2007
Springer
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
LPNMR
2009
Springer
14 years 4 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
ICFP
2012
ACM
12 years 10 days ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...