-
1
-
-
0000807910
-
A filter lambda model and the completeness of type assignment
-
H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symb. Log., 48(4):931-940, 1983.
-
(1983)
J. Symb. Log.
, vol.48
, Issue.4
, pp. 931-940
-
-
Barendregt, H.1
Coppo, M.2
Dezani-Ciancaglini, M.3
-
2
-
-
78449303599
-
Recursion schemes and logical reflection
-
IEEE Computer Society Press
-
C. H. Broadbent, A. Carayol, C.-H. L. Ong, and O. Serre. Recursion schemes and logical reflection. In Proceedings of LICS 2010, pages 120-129. IEEE Computer Society Press, 2010.
-
(2010)
Proceedings of LICS 2010
, pp. 120-129
-
-
Broadbent, C.H.1
Carayol, A.2
Ong, C.-H.L.3
Serre, O.4
-
3
-
-
43049155961
-
Efficient memory representation of XML document trees
-
G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML document trees. Inf. Syst., 33(4-5):456-474, 2008.
-
(2008)
Inf. Syst.
, vol.33
, Issue.4-5
, pp. 456-474
-
-
Busatto, G.1
Lohrey, M.2
Maneth, S.3
-
4
-
-
0004060205
-
-
release October, 12th 2007
-
H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 2007. release October, 12th 2007.
-
(2007)
Tree Automata Techniques and Applications
-
-
Comon, H.1
Dauchet, M.2
Gilleron, R.3
Löding, C.4
Jacquemard, F.5
Lugiez, D.6
Tison, S.7
Tommasi, M.8
-
6
-
-
0024096653
-
High level tree transducers and iterated pushdown tree transducers
-
J. Engelfriet and H. Vogler. High level tree transducers and iterated pushdown tree transducers. Acta Inf., 26(1/2):131-192, 1988.
-
(1988)
Acta Inf.
, vol.26
, Issue.1-2
, pp. 131-192
-
-
Engelfriet, J.1
Vogler, H.2
-
8
-
-
51549119988
-
Collapsible pushdown automata and recursion schemes
-
IEEE Computer Society
-
M. Hague, A. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In Proceedings of LICS 2008, pages 452-461. IEEE Computer Society, 2008.
-
(2008)
Proceedings of LICS 2008
, pp. 452-461
-
-
Hague, M.1
Murawski, A.2
Ong, C.-H.L.3
Serre, O.4
-
10
-
-
0003136670
-
Learning translation templates from bilingual text
-
H. Kaji, Y. Kida, and Y. Morimoto. Learning translation templates from bilingual text. In COLING, pages 672-678, 1992.
-
(1992)
COLING
, pp. 672-678
-
-
Kaji, H.1
Kida, Y.2
Morimoto, Y.3
-
11
-
-
0012491117
-
An efficient pattern matching algorithm for strings with short description
-
M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern matching algorithm for strings with short description. Nordic Journal on Computing, 4(2):129-144, 1997.
-
(1997)
Nordic Journal on Computing
, vol.4
, Issue.2
, pp. 129-144
-
-
Karpinski, M.1
Rytter, W.2
Shinohara, A.3
-
12
-
-
0037418753
-
Collage system: A unifying framework for compressed pattern matching
-
T. Kida, T. Matsumoto, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci., 1(298):253-272, 2003.
-
(2003)
Theor. Comput. Sci.
, vol.1
, Issue.298
, pp. 253-272
-
-
Kida, T.1
Matsumoto, T.2
Shibata, Y.3
Takeda, M.4
Shinohara, A.5
Arikawa, S.6
-
13
-
-
84948946239
-
Higher-order pushdown trees are easy
-
Proceedings of FOSSACS 2002. Springer- Verlag
-
T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In Proceedings of FOSSACS 2002, volume 2303 of LNCS, pages 205-222. Springer-Verlag, 2002.
-
(2002)
LNCS
, vol.2303
, pp. 205-222
-
-
Knapik, T.1
Niwinski, D.2
Urzyczyn, P.3
-
14
-
-
70450225396
-
Model-checking higher-order functions
-
ACM Press
-
N. Kobayashi. Model-checking higher-order functions. In Proceedings of PPDP 2009, pages 25-36. ACM Press, 2009.
-
(2009)
Proceedings of PPDP 2009
, pp. 25-36
-
-
Kobayashi, N.1
-
15
-
-
67649842775
-
Types and higher-order recursion schemes for verification of higher-order programs
-
N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. In Proc. of POPL, pages 416-428, 2009.
-
(2009)
Proc. of POPL
, pp. 416-428
-
-
Kobayashi, N.1
-
16
-
-
79953195556
-
A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
-
Proceedings of FOSSACS 2011. Springer- Verlag
-
N. Kobayashi. A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes. In Proceedings of FOSSACS 2011, volume 6604 of LNCS, pages 260-274. Springer-Verlag, 2011.
-
(2011)
LNCS
, vol.6604
, pp. 260-274
-
-
Kobayashi, N.1
-
22
-
-
33745144678
-
Tree transducers and tree compressions
-
Proceedings of FOSSACS 2004. Springer- Verlag
-
S. Maneth and G. Busatto. Tree transducers and tree compressions. In Proceedings of FOSSACS 2004, volume 2987 of LNCS, pages 363-377. Springer-Verlag, 2004.
-
(2004)
LNCS
, vol.2987
, pp. 363-377
-
-
Maneth, S.1
Busatto, G.2
-
23
-
-
59049103692
-
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
-
W. Matsubara, S. Inenaga, A. Ishino, A. Shinohara, T. Nakamura, and K. Hashimoto. Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci., 410(8-10):900-913, 2009.
-
(2009)
Theor. Comput. Sci.
, vol.410
, Issue.8-10
, pp. 900-913
-
-
Matsubara, W.1
Inenaga, S.2
Ishino, A.3
Shinohara, A.4
Nakamura, T.5
Hashimoto, K.6
-
24
-
-
0000523223
-
Compression and explanation using hierarchical grammars
-
C. G. Nevill-Manning and I. H. Witten. Compression and explanation using hierarchical grammars. Comput. J., 40(2/3):103-116, 1997.
-
(1997)
Comput. J.
, vol.40
, Issue.2-3
, pp. 103-116
-
-
Nevill-Manning, C.G.1
Witten, I.H.2
-
25
-
-
34547348202
-
On model-checking trees generated by higher-order recursion schemes
-
DOI 10.1109/LICS.2006.38, 1691219, Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006
-
C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS 2006, pages 81-90. IEEE Computer Society Press, 2006. (Pubitemid 47130354)
-
(2006)
Proceedings - Symposium on Logic in Computer Science
, pp. 81-90
-
-
Ong, C.-H.L.1
-
26
-
-
85016671597
-
Testing equivalence of morphisms on context-free languages
-
ESA'94. Springer- Verlag
-
W. Plandowski. Testing equivalence of morphisms on context-free languages. In ESA'94, volume 855 of LNCS, pages 460-470. Springer-Verlag, 1994.
-
(1994)
LNCS
, vol.855
, pp. 460-470
-
-
Plandowski, W.1
-
27
-
-
0038238644
-
Application of Lempel-Ziv factorization to the approximation of grammar-based compression
-
W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci., 302(1-3):211-222, 2003.
-
(2003)
Theor. Comput. Sci.
, vol.302
, Issue.1-3
, pp. 211-222
-
-
Rytter, W.1
-
28
-
-
35048858264
-
Grammar compression, LZ-encodings, and string algorithms with implicit input
-
ICALP'04. Springer- Verlag
-
W. Rytter. Grammar compression, LZ-encodings, and string algorithms with implicit input. In ICALP'04, volume 3142 of LNCS, pages 15-27. Springer-Verlag, 2004.
-
(2004)
LNCS
, vol.3142
, pp. 15-27
-
-
Rytter, W.1
-
29
-
-
18544376055
-
A fully linear-time approximation algorithm for grammar-based compression
-
DOI 10.1016/j.jda.2004.08.016, PII S1570866704000632, Combinatorial Pattern Modelling (CPM) Special Issue
-
H. Sakamoto. A fully linear-time approximation algorithm for grammar-based compression. Journal of Discrete Algorithms, 3(2-4):416-430, 2005. (Pubitemid 40655189)
-
(2005)
Journal of Discrete Algorithms
, vol.3
, Issue.2-4
, pp. 416-430
-
-
Sakamoto, H.1
-
30
-
-
0033281002
-
Review article: Example-based machine translation
-
H. L. Somers. Review article: Example-based machine translation. Machine Translation, 14(2):113-157, 1999.
-
(1999)
Machine Translation
, vol.14
, Issue.2
, pp. 113-157
-
-
Somers, H.L.1
-
31
-
-
0002925530
-
The typed lambda-calculus is not elementary recursive
-
R. Statman. The typed lambda-calculus is not elementary recursive. Theor. Comput. Sci., 9:73-81, 1979.
-
(1979)
Theor. Comput. Sci.
, vol.9
, pp. 73-81
-
-
Statman, R.1
-
34
-
-
85174911962
-
Binary lambda calculus and combinatory logic
-
Kolmogorov Complexity and Applications, volume 06051
-
J. Tromp. Binary lambda calculus and combinatory logic. In Kolmogorov Complexity and Applications, volume 06051 of Dagstuhl Seminar Proceedings, 2006.
-
(2006)
Dagstuhl Seminar Proceedings
-
-
Tromp, J.1
-
35
-
-
77951439728
-
Untyped recursion schemes and infinite intersection types
-
Proceedings of FOSSACS 2010. Springer- Verlag
-
T. Tsukada and N. Kobayashi. Untyped recursion schemes and infinite intersection types. In Proceedings of FOSSACS 2010, volume 6014 of LNCS, pages 343-357. Springer-Verlag, 2010.
-
(2010)
LNCS
, vol.6014
, pp. 343-357
-
-
Tsukada, T.1
Kobayashi, N.2
-
36
-
-
0029406599
-
Intersection type assignment systems
-
S. van Bakel. Intersection type assignment systems. Theor. Comput. Sci., 151(2):385-435, 1995.
-
(1995)
Theor. Comput. Sci.
, vol.151
, Issue.2
, pp. 385-435
-
-
Van Bakel, S.1
|