Sciweavers

6274 search results - page 77 / 1255
» Proofs, Programs, Processes
Sort
View
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
14 years 4 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
Adrian Craciun, Madalina Hodorog
JELIA
1998
Springer
14 years 2 months ago
A Matrix Characterization for MELL
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic with exponentials. In the process we elaborate a methodology for proving mat...
Heiko Mantel, Christoph Kreitz
CIE
2006
Springer
14 years 1 months ago
Datatype-Generic Reasoning
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review th...
Roland Carl Backhouse
EOR
2008
75views more  EOR 2008»
13 years 10 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
ICALP
2007
Springer
14 years 4 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta