Efficient execution in a class of term rewriting systemsSUGIYAMA, Y; TANIGUCHI, K; KASAMI, T et al.Systems, computers, controls. 1982, Vol 13, Num 4, pp 22-30, issn 0096-8765Article

The liveness property of on-the-fly garbage collector: a proofRAMESH, S; MEHNDIRATTA, S. L.Information processing letters. 1983, Vol 17, Num 4, pp 189-195, issn 0020-0190Article

On the notion of expressiveness and the rule of adaptationOLDEROG, E.-R.Theoretical computer science. 1983, Vol 24, Num 3, pp 337-347, issn 0304-3975Article

A logic covering undefinedness in program proofsBARRINGER, H; CHENG, J. H; JONES, C. B et al.Acta informatica. 1984, Vol 21, Num 3, pp 251-269, issn 0001-5903Article

Problème de choix de la précédence pour l'ordre de décomposition = Precedence choice problem for decomposition orderCHOQUE, Ghislaine.1983, 90 pThesis

Preuves de vivacité des programmes séquentiels dans la logique temporelle = Vivacity proofs of sequential programs in temporal logicDELPORTE, Carole.1983, 227 fThesis

TYPES 2003 : types for proofs and programs (Torino, 30 April - 4 May 2003, revised selected papers)Berardi, Stefano; Coppo, Mario; Damiani, Ferruccio et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22164-6, X, 408 p, isbn 3-540-22164-6Conference Proceedings

Hierarchies of primitive recursive wordsequence functions: comparisons and decision problemsFACHINI, E; NAPOLI, M.Theoretical computer science. 1984, Vol 29, Num 1-2, pp 185-227, issn 0304-3975Article

Ten years of Hoarés logic: a survey. II: NondeterminismAPT, K. R.Theoretical computer science. 1984, Vol 28, Num 1-2, pp 83-109, issn 0304-3975Article

Theory of program testing ― An overviewPRATHER, R. E.The Bell System technical journal. 1983, Vol 62, Num 10, pp 3073-3105, issn 0005-8580Article

Terminaison des systèmes de réécriture = Termination of rewriting systemsMOUFFRON, M.1983, 27 p.Report

Program inversion: more than fun!CHEN, W; UDDING, J. T.Science of computer programming. 1990, Vol 15, Num 1, pp 1-13, issn 0167-6423, 13 p.Article

The incompleteness of misra and Chandy's proof systemsVAN NGUYEN.Information processing letters. 1985, Vol 21, Num 2, pp 93-96, issn 0020-0190Article

Proving program inclusion using Hoare's logicBERGSTRA, J. A; KLOP, J. W.Theoretical computer science. 1984, Vol 30, Num 1, pp 1-48, issn 0304-3975Article

A framework for deductive logic program synthesisSATO, T; TAMAKI, H.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1984, Vol 67, Num 10, pp 549-554, issn 0387-236XArticle

Conditional rewrite rulesKAPLAN, S.Theoretical computer science. 1984, Vol 33, Num 2-3, pp 175-193, issn 0304-3975Article

Fair termination revisited-with delayAPT, K. R; PNUELI, A; STAVI, J et al.Theoretical computer science. 1984, Vol 33, Num 1, pp 65-84, issn 0304-3975Article

An algorithm translating recursive programs into horn setsKISHI, T; YAMASAKI, S; DOSHITA, S et al.Systems, computers, controls. 1983, Vol 14, Num 1, pp 1-8, issn 0096-8765Article

Correctness of recursive parallel nondeterministic flow programsGOGUEN, J. A; MESEGUER, J.Journal of computer and system sciences (Print). 1983, Vol 27, Num 2, pp 268-290, issn 0022-0000Article

Wellfounded trees and dependent polynomial functorsGAMBINO, Nicola; HYLAND, Martin.Lecture notes in computer science. 2004, pp 210-225, issn 0302-9743, isbn 3-540-22164-6, 16 p.Conference Paper

A new computational model and its discipline of programming; Γ : un formalisme pour la construction et la preuve de programmesBANATRE, Jean-Pierre; LE METAYER, Daniel.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 566. 1986, 24 p.Report

The undecidability of self-embedding for term rewriting systemsPLAISTED, D. A.Information processing letters. 1985, Vol 20, Num 2, pp 61-64, issn 0020-0190Article

Partial correctness: the term-wise approachSOKOŁOWSKI, S.Science of computer programming. 1984, Vol 4, Num 2, pp 141-157, issn 0167-6423Article

Recursion as an effective step in program developmentCOLUSSI, L.ACM transactions on programming languages and systems. 1984, Vol 6, Num 1, pp 55-67, issn 0164-0925Article

On verification of programs with goto statementsLIFSCHITZ, V.Information processing letters. 1984, Vol 18, Num 4, pp 221-225, issn 0020-0190Article