Sciweavers

1598 search results - page 77 / 320
» A Unified Computation Model for Functional and Logic Program...
Sort
View
196
Voted
ICLP
2011
Springer
14 years 8 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
184
Voted
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 11 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
PLDI
2010
ACM
16 years 2 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
DAC
2006
ACM
16 years 5 months ago
Transistor abstraction for the functional verification of FPGAs
or Abstraction for the Functional Verification of FPGAs Guy Dupenloup, Thierry Lemeunier, Roland Mayr Altera Corporation 101 Innovation Drive San Jose, CA 95134 1-408-544-8672 {gdu...
Guy Dupenloup, Thierry Lemeunier, Roland Mayr
ICFP
2008
ACM
16 years 4 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...