Sciweavers

432 search results - page 28 / 87
» Type Inference for COBOL Systems
Sort
View
110
Voted
DBPL
1987
Springer
113views Database» more  DBPL 1987»
15 years 7 months ago
Orderings and Types in Databases
This paper investigates a method to represent database objects as typed expressions in programming languages. A simple typed language supporting non-flat records, higher-order rel...
Atsushi Ohori
123
Voted
VL
2002
IEEE
15 years 8 months ago
Visually Customizing Inference Rules About Apples and Oranges
We have been working on a unit system for end-user spreadsheets that is based on the concrete notion of units of the abstract concept of types. In previous work, we defined such ...
Margaret M. Burnett, Martin Erwig
141
Voted
BIRTHDAY
2010
Springer
15 years 3 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
TPHOL
2000
IEEE
15 years 7 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
144
Voted
TPHOL
2007
IEEE
15 years 9 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker