Sciweavers

95 search results - page 6 / 19
» Basic Category Theory for Models of Syntax
Sort
View
ACL
1994
13 years 8 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
ESWS
2008
Springer
13 years 9 months ago
Foundations of RDF Databases
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
Claudio Gutierrez
IFIP
2004
Springer
14 years 23 days ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
ENTCS
2006
150views more  ENTCS 2006»
13 years 7 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota