Sciweavers

3658 search results - page 357 / 732
» The logic of proofs, semantically
Sort
View

Book
290views
17 years 5 months ago
Type Theory and Functional Programming
"Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scient...
Simon Thompson
POPL
2004
ACM
16 years 8 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
205
Voted
CADE
2006
Springer
16 years 8 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
LICS
2008
IEEE
16 years 2 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
AIMSA
2008
Springer
16 years 2 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek