84 search results - page 9 / 17 » A Calculus for Link-Time Compilation |
114
Voted
WIA
2000
Springer
15 years 1 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
TACS
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Security-typed languages enforce confidentiality or integrity policies by type checking. This paper investigates continuation-passing style (CPS) translation of such languages as ...
ECEASST
2008
14 years 9 months ago
2008
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...