Sciweavers

199 search results - page 2 / 40
» Guarded Dependent Type Theory with Coinductive Types
Sort
View
CIE
2005
Springer
13 years 11 months ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
13 years 10 months ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...
LICS
2008
IEEE
13 years 11 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
ICFP
1996
ACM
13 years 9 months ago
Inductive, Coinductive, and Pointed Types
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
Brian T. Howard
ENTCS
2008
128views more  ENTCS 2008»
13 years 5 months ago
Towards Formalizing Categorical Models of Type Theory in Type Theory
This note is about work in progress on the topic of "internal type theory" where we investigate the internal formalization of the categorical metatheory of constructive ...
Alexandre Buisse, Peter Dybjer