Sciweavers

900 search results - page 15 / 180
» Pure Type Systems Formalized
Sort
View
TACS
1994
Springer
13 years 11 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi
ENTCS
2008
175views more  ENTCS 2008»
13 years 7 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
ISSAC
1998
Springer
117views Mathematics» more  ISSAC 1998»
13 years 11 months ago
Lightweight Formal Methods for Computer Algebra Systems
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
Martin Dunstan, Tom Kelsey, Steve Linton, Ursula M...
TYPES
2007
Springer
14 years 1 months ago
Characterising Strongly Normalising Intuitionistic Sequent Terms
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the ...
José Espírito Santo, Silvia Ghilezan...