𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bialgebraic Semantics and Recursion: (Extended Abstract)

✍ Scribed by Gordon Plotkin

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
85 KB
Volume
44
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bialgebras of Recursive Sequences and Co
Bialgebras of Recursive Sequences and Combinatorial Identities
✍ Carl A. Futia; Eric F. MΓΌller; Earl J. Taft πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 194 KB

A recursive sequence is an infinite sequence of elements of some fixed ground field which satisfies a recursion relation of finite order. We shall investigate certain bialgebra structures on linear spaces of recursive sequences. By choosing appropriate bases for these bialgebras we show how an expli

Semantic Domains, Injective Spaces and M
Semantic Domains, Injective Spaces and Monads: Extended Abstract
✍ MartΓ­n H. EscardΓ³; Robert C. Flagg πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 972 KB

Many categories of semantic domains can be considered from an order-theoretic point of view and from a topological point of view via the Scott topology. The topological point of view is particularly fruitful for considerations of computability in classical spaces such as the Euclidean real line. Whe

Extending and implementing the stable mo
Extending and implementing the stable model semantics
✍ Patrik Simons; Ilkka NiemelΓ€; Timo Soininen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 457 KB

A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities