660 search results - page 123 / 132 » The Implicit Calculus of Constructions |
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
KBSE
2007
IEEE
14 years 3 months ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
ICEIS
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
TLDI
2005
ACM
14 years 2 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...