Sciweavers

251 search results - page 1 / 51
» Pure Type Systems without Explicit Contexts
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 4 months ago
Pure Type Systems without Explicit Contexts
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of the shape A : B, our systems just have judgments of the ...
Herman Geuvers, Robbert Krebbers, James McKinna, F...
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 1 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
BIRTHDAY
2004
Springer
13 years 10 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
TSD
2004
Springer
13 years 10 months ago
Handling Multi-word Expressions Without Explicit Linguistic Rules in an MT System
Abstract. Translation of Multi-word expressions (MWEs) is one of the most challenging tasks of a Machine translation (MT) system. In this paper, we present an innovative technique ...
Akshar Bharati, Rajeev Sangal, Dipti Mishra, Srira...
POPL
2010
ACM
14 years 1 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins