5 search results - page 1 / 1 » Safe Recursion on Notation into a Light Logic by Levels |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
IWFM
1998
13 years 6 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
ECOOP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
COLING
1992
13 years 6 months ago
1992
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
TPHOL
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...