Sciweavers

8232 search results - page 296 / 1647
» Dynamic Logic Programming
Sort
View
ICFP
2010
ACM
15 years 6 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
TPHOL
2007
IEEE
16 years 28 days ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
ENTCS
2002
92views more  ENTCS 2002»
15 years 6 months ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...

Book
2455views
17 years 4 months ago
Art of Programming Contest - C Programming Tutorials | Data Structures | Algorithms
"The objective of this edition is not only to assist the contestants during the contest hours but also describing the core subjects of Computer Science such as C Programming, ...
Ahmed Shamsul Arefin
EOR
2006
65views more  EOR 2006»
15 years 6 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini