Sciweavers

4850 search results - page 301 / 970
» Proof and Computation in Geometry
Sort
View
CEFP
2007
Springer
16 years 27 days ago
Proving Properties of Lazy Functional Programs with Sparkle
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
FSTTCS
2005
Springer
16 years 7 days ago
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saras...
ATAL
2000
Springer
15 years 11 months ago
Determining the Envelope of Emergent Agent Behaviour via Architectural Transformation
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
IACR
2011
112views more  IACR 2011»
14 years 6 months ago
A Domain Transformation for Structure-Preserving Signatures on Group Elements
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
Melissa Chase, Markulf Kohlweiss
TLCA
1997
Springer
15 years 11 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein