273 search results - page 20 / 55 » A Compositional Semantics for Conditional Term Rewriting Sys... |
112
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Finding biological entities (such as genes or proteins) that satisfy certain conditions from texts is an important and challenging task in biomedical information retrieval and tex...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
100
click to vote
FMCAD
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
192
click to vote
POPL
2003
ACM
16 years 30 min ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
103
click to vote
BIRTHDAY
2010
Springer
14 years 9 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...