Sciweavers

315 search results - page 22 / 63
» A generic type system for the Pi-calculus
Sort
View
POPL
2012
ACM
12 years 3 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
ICFP
2003
ACM
14 years 7 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
ATAL
2008
Springer
13 years 9 months ago
Goals in agent systems: a unifying framework
In the literature on agent systems, the proactive behavior of agents is often modeled in terms of goals that the agents pursue. We review a number of commonly-used existing goal t...
M. Birna van Riemsdijk, Mehdi Dastani, Michael Win...
DEXAW
1999
IEEE
94views Database» more  DEXAW 1999»
14 years 3 days ago
Reuse, Validation and Verification of System Development Processes
The wide variety of abstract system development methodologies available includes the waterfall and V models. These models are often too generic and need careful adaptation to suit ...
Peter J. Funk, Ivica Crnkovic
TLCA
2007
Springer
14 years 1 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva