Sciweavers

900 search results - page 8 / 180
» Pure Type Systems Formalized
Sort
View
CSL
2006
Springer
13 years 11 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
ENTCS
2002
77views more  ENTCS 2002»
13 years 7 months ago
Syntactic Type Soundness for HM(X)
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Christian Skalka, François Pottier
IFL
2001
Springer
14 years 10 hour ago
Sized Types for Typing Eden Skeletons
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...
Ricardo Pena, Clara Segura
COORDINATION
2006
Springer
13 years 11 months ago
A WSDL-Based Type System for WS-BPEL
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
TPHOL
1999
IEEE
13 years 12 months ago
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...
Stefan Berghofer, Markus Wenzel