86 search results - page 4 / 18 » Constructive Data Refinement in Typed Lambda Calculus |
TOCL
2012
11 years 10 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
SCP
2011
13 years 2 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
ACL
2001
13 years 9 months ago
2001
We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to t...
SEFM
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents an implicitly-typed functional, aspect-oriented programming language: λ AOP. The main contribution of the paper is a semantics for λ AOP advice weaving. The ...