Sciweavers

1948 search results - page 202 / 390
» Formalizing Mirror Theory
Sort
View
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
16 years 3 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
16 years 22 days ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
OWLED
2008
15 years 8 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves
ACL
1994
15 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
SYNTHESE
2010
87views more  SYNTHESE 2010»
15 years 5 months ago
Proofs, pictures, and Euclid
Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With re...
John Mumma