Sciweavers

1458 search results - page 98 / 292
» Extended Term Rewriting Systems
Sort
View
HASKELL
2009
ACM
15 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
ESOP
2001
Springer
15 years 2 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
VMCAI
2004
Springer
15 years 3 months ago
A Grand Challenge for Computing: Towards Full Reactive Modeling of a Multi-cellular Animal
Biological systems can be modeled beneficially as reactive systems, using languages and tools developed for the construction of man-made systems. Our long-term aim is to model a f...
David Harel
WWW
2006
ACM
15 years 10 months ago
Searching with context
Contextual search refers to proactively capturing the information need of a user by automatically augmenting the user query with information extracted from the search context; for...
Reiner Kraft, Chi-Chao Chang, Farzin Maghoul, Ravi...
TPHOL
2007
IEEE
15 years 4 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker