Sciweavers

291 search results - page 42 / 59
» A Logic for Parametric Polymorphism
Sort
View
IANDC
2006
93views more  IANDC 2006»
15 years 1 months ago
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
Jia Meng, Claire Quigley, Lawrence C. Paulson
131
Voted
TCOM
2010
168views more  TCOM 2010»
14 years 8 months ago
A unified analysis of routing protocols in MANETs
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified fram...
Hui Xu, Xianren Wu, Hamid R. Sadjadpour, J. J. Gar...
POPL
2007
ACM
16 years 2 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 8 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
DALT
2004
Springer
15 years 7 months ago
On Modelling Multi-agent Systems Declaratively
Abstract. We propose a declarative framework for modelling multi-agent systems and specify a number of properties of these systems and agents within them. The framework is parametr...
Andrea Bracciali, Paolo Mancarella, Kostas Stathis...