Sciweavers

21 search results - page 4 / 5
» A Dependent Type Theory with Names and Binding
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 5 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
ENTCS
2008
137views more  ENTCS 2008»
13 years 5 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells
CADE
2002
Springer
14 years 5 months ago
Basic Syntactic Mutation
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
Christopher Lynch, Barbara Morawska
GI
1997
Springer
13 years 9 months ago
Persistent Object Systems: From Technology to Market
Abstract. This text describes how persistent object system technology developed in European basic research is being used by a small German startup software company to realize innov...
Andreas Gawecki, Florian Matthes, Joachim W. Schmi...
EMSOFT
2008
Springer
13 years 7 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...