1948 search results - page 40 / 390 » Formalizing Mirror Theory |
ITICSE
2005
ACM
14 years 2 months ago
2005
ACM
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...
JAPLL
2011
13 years 3 months ago
2011
The paper proposes a formal analysis of a theory of norms resulting from pulling together Anderson’s reduction, the analysis of counts-as, and a novel approach to the formal rep...
MPC
2010
Springer
14 years 1 months ago
2010
Springer
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and...
DATESO
2004
13 years 10 months ago
2004
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binar...
ICDE
1994
IEEE
14 years 24 days ago
1994
IEEE
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...