Sciweavers

640 search results - page 96 / 128
» Logical types for untyped languages
Sort
View
POPL
2007
ACM
14 years 9 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
POPL
2001
ACM
14 years 9 months ago
Oracle-based checking of untrusted software
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
George C. Necula, Shree Prakash Rahul
IR
2007
13 years 8 months ago
Learning-based summarisation of XML documents
Documents formatted in eXtensible Markup Language (XML) are available in collections of various document types. In this paper, we present an approach for the summarisation of XML d...
Massih-Reza Amini, Anastasios Tombros, Nicolas Usu...
CADE
2010
Springer
13 years 10 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
ICTAC
2010
Springer
13 years 7 months ago
A Modality for Safe Resource Sharing and Code Reentrancy
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
Rui Shi, Dengping Zhu, Hongwei Xi