A direct proof of the confluence of combinatory strong reductionDAVID, René.Theoretical computer science. 2009, Vol 410, Num 42, pp 4204-4215, issn 0304-3975, 12 p.Article

Inductive type schemas as functorsBARRAL, Freiric; SOLOVIEV, Sergei.Lecture notes in computer science. 2006, pp 35-45, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 11 p.Conference Paper

On confluence of infinitary combinatory reduction systemsKETEMA, Jeroen; SIMONSEN, Jakob Grue.Lecture notes in computer science. 2005, pp 199-214, issn 0302-9743, isbn 3-540-30553-X, 1Vol, 16 p.Conference Paper

Converging glacier flow _ A case study : the UnteraarglacierGUDMUNDSSON, G. HILMAR.Mitteilungen der Versuchsanstalt fur Wasserbau, Hydrologie und Glaziologie an der Eidgenossischen Technischen Hochschule Zurich. 1994, Num 131, issn 0374-0056, 120 p.Serial Issue

Modularity of confluence: A simplified proofKLOP, J. W; MIDDELDORP, A; TOYAMA, Y et al.Information processing letters. 1994, Vol 49, Num 2, pp 101-109, issn 0020-0190Article

λHENDRIKS, Dimitri; VAN OOSTROM, Vincent.Lecture notes in computer science. 2003, pp 136-150, issn 0302-9743, isbn 3-540-40559-3, 15 p.Conference Paper

Creativity or creativities?STERNBERG, Robert J.International journal of human-computer studies. 2005, Vol 63, Num 4-5, pp 370-382, issn 1071-5819, 13 p.Article

Is 3D chip technology the next growth engine for performance improvement?EMMA, P. G; KURSUN, E.IBM journal of research and development. 2008, Vol 52, Num 6, pp 541-552, issn 0018-8646, 12 p.Article

Adhesive high-level replacement categories and systemsEHRIG, Hartmut; HABEL, Annegret; PADBERG, Julia et al.Lecture notes in computer science. 2004, pp 144-160, issn 0302-9743, isbn 3-540-23207-9, 17 p.Conference Paper

La logique de réécriture : un formalisme pour modéliser les bases de données actives = Logic of the rewriting: a formalism for modeling the active databasesRABIH, Y.INFORSID. Congrès. 1996, pp 351-367, isbn 2-906855-12-XConference Paper

Completeness of combinations of constructor systemsMIDDELDORP, A; TOYAMA, Y.Journal of symbolic computation. 1993, Vol 15, Num 3, pp 331-348, issn 0747-7171Article

Acute pancreatitis and a long common channelKAMISAWA, Terumi; YUYANG TU; NAKAJIMA, Hitoshi et al.Abdominal imaging. 2007, Vol 32, Num 3, pp 365-369, issn 0942-8925, 5 p.Article

Modular church-rosser moduloJOUANNAUD, Jean-Pierre.Lecture notes in computer science. 2006, pp 96-107, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 12 p.Conference Paper

Confluence and strong normalisation of the generalised multiary λ-calculusSANTO, Josh Espirito; PINTO, Luis.Lecture notes in computer science. 2004, pp 194-209, issn 0302-9743, isbn 3-540-22164-6, 16 p.Conference Paper

Resurgent methods in semi-classical asymptoticsDELABAERE, E; PHAM, F.Annales de l'I.H.P. Physique théorique. 1999, Vol 71, Num 1, pp 1-94, issn 0246-0211Article

Confluence properties of weak and strong calculi of explicit substitutionsCURIEN, P.-L; HARDIN, T; LEVY, J.-J et al.Journal of the Association for Computing Machinery. 1996, Vol 43, Num 2, pp 362-397, issn 0004-5411Article

Open. closed. openDERSHOWITZ, Nachum.Lecture notes in computer science. 2005, pp 376-393, issn 0302-9743, isbn 3-540-25596-6, 18 p.Conference Paper

Processes, terms and cycles : steps on the road to infinity (essays dedicated to Jan Willem Klop on the occasion of his 60th birthday)Middeldorp, Aart; Oostrom, Vincent van; Raamsdonk, Femke van et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30911-X, 1Vol, XVIII-639 p, isbn 3-540-30911-XBook

Higher-order rewriting : Framework, confluence and terminationJOUANNAUD, Jean-Pierre.Processes, terms and cycles : steps on the road to infinity (essays dedicated to Jan Willem Klop on the occasion of his 60th birthday). Lecture notes in computer science. 2005, pp 224-250, issn 0302-9743, isbn 3-540-30911-X, 1Vol, 27 p.Book Chapter

The undecidability of the first-order theories of one step rewriting in linear canonical systemsVOROBYOV, Sergei.Information and computation (Print). 2002, Vol 175, Num 2, pp 182-213, issn 0890-5401Article

Confluence of untyped lambda calculus via simple typesGHILEZAN, Silvia; KUNCAK, Viktor.Lecture notes in computer science. 2001, pp 38-49, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Confluence by decreasing diagramsVAN OOSTROM, V.Theoretical computer science. 1994, Vol 126, Num 2, pp 259-280, issn 0304-3975Article

Expression reduction systems and extensions : An overviewGLAUERT, John; KESNER, Delia; KHASIDASHVILI, Zurab et al.Processes, terms and cycles : steps on the road to infinity (essays dedicated to Jan Willem Klop on the occasion of his 60th birthday). Lecture notes in computer science. 2005, pp 496-553, issn 0302-9743, isbn 3-540-30911-X, 1Vol, 58 p.Book Chapter

Strong normalization of the dual classical sequent calculusDOUGHERTY, Daniel; GHILEZAN, Silvia; LESCANNE, Pierre et al.Lecture notes in computer science. 2005, pp 169-183, issn 0302-9743, isbn 3-540-30553-X, 1Vol, 15 p.Conference Paper

An extensional Böhm modelSEVERI, Paula; DE VRIES, Fer-Jan.Lecture notes in computer science. 2002, pp 159-173, issn 0302-9743, isbn 3-540-43916-1, 15 p.Conference Paper