42 search results - page 8 / 9 » Pure Type Systems in Rewriting Logic: Specifying Typed Highe... |
PPDP
2007
Springer
14 years 8 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We provide an overall description of the Ciao multiparadigm programming system emphasizing some of the novel aspects and motivations behind its design and implementation. An impor...
ICFP
2005
ACM
14 years 6 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
EMNLP
2010
13 years 4 months ago
2010
In contrast with the booming increase of internet data, state-of-art QA (question answering) systems, otherwise, concerned data from specific domains or resources such as search e...