Journals in DBLP
Carsten Schürmann , Joëlle Despeyroux , Frank Pfenning Primitive recursion for higher-order abstract syntax. [Citation Graph (0, 0)][DBLP ] Journal ] Tatsuru Matsushita , Colin Runciman The accepting power of unary string logic programs. [Citation Graph (0, 0)][DBLP ] Journal ] Gabriel Aguilera , Inman P. de Guzmán , Manuel Ojeda-Aciego , Agustín Valverde Reductions for non-clausal theorem proving. [Citation Graph (0, 0)][DBLP ] Journal ] Klaus U. Schulz , Stephan Kepser Combination of constraint systems II: Rational amalgamation. [Citation Graph (0, 0)][DBLP ] Journal ] René David On the asymptotic behaviour of primitive recursive algorithms. [Citation Graph (0, 0)][DBLP ] Journal ] Karl Lermer , Paul A. Strooper Refinement and state machine abstraction. [Citation Graph (0, 0)][DBLP ] Journal ] Michele Boreale , Rocco De Nicola , Rosario Pugliese Divergence in testing and readiness semantics. [Citation Graph (0, 0)][DBLP ] Journal ] Masatomo Hashimoto , Atsushi Ohori A typed context calculus. [Citation Graph (0, 0)][DBLP ] Journal ] David Aspinall , Adriana B. Compagnoni Subtyping dependent types. [Citation Graph (0, 0)][DBLP ] Journal ] Manolis Koubarakis Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. [Citation Graph (0, 0)][DBLP ] Journal ] Ralph Loader Finitary PCF is not decidable. [Citation Graph (0, 0)][DBLP ] Journal ] Duminda Wijesekera , M. Ganesh , Jaideep Srivastava , Anil Nerode Normal forms and syntactic completeness proofs for functional independencies. [Citation Graph (0, 0)][DBLP ] Journal ] César Muñoz Proof-term synthesis on dependent-type systems via explicit substitutions. [Citation Graph (0, 0)][DBLP ] Journal ] Yi-Dong Shen , Li-Yan Yuan , Jia-Huai You Loop checks for logic programs with functions. [Citation Graph (0, 0)][DBLP ] Journal ] Michel Bauderon , Hélène Jacquet Node rewriting in graphs and hypergraphs: a categorical framework. [Citation Graph (0, 0)][DBLP ] Journal ] Susumu Yamasaki , Yoshinori Kurose A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics. [Citation Graph (0, 0)][DBLP ] Journal ] Annabelle McIver , Carroll Morgan Partial correctness for probabilistic demonic programs. [Citation Graph (0, 0)][DBLP ] Journal ] Riccardo Pucella , Prakash Panangaden On the expressive power of first-order boolean functions in PCF. [Citation Graph (0, 0)][DBLP ] Journal ] Cédric Fournet , Cosimo Laneve Bisimulations in the join-calculus. [Citation Graph (0, 0)][DBLP ] Journal ] Jirí Srba Basic process algebra with deadlocking states. [Citation Graph (0, 0)][DBLP ] Journal ] Jan Friso Groote , Jos van Wamel The parallel composition of uniform processes with data. [Citation Graph (0, 0)][DBLP ] Journal ] Uri Abraham , Shlomi Dolev , Ted Herman , Irit Koll Self-stabilizing l-exclusion. [Citation Graph (0, 0)][DBLP ] Journal ] James Riely , Matthew Hennessy Distributed processes and location failures. [Citation Graph (0, 0)][DBLP ] Journal ] Zurab Khasidashvili On the longest perpetual reductions in orthogonal expression reduction systems. [Citation Graph (0, 0)][DBLP ] Journal ] Gilles Barthe , John Hatcliff , Morten Heine Sørensen An induction principle for pure type systems. [Citation Graph (0, 0)][DBLP ] Journal ] Karl Schlechta , Jürgen Dix Explaining updates by minimal sums. [Citation Graph (0, 0)][DBLP ] Journal ] Mingsheng Ying , Martin Wirsing Recursive equations in higher-order process calculi. [Citation Graph (0, 0)][DBLP ] Journal ] Robert Goldblatt What is the coalgebraic analogue of Birkhoff's variety theorem? [Citation Graph (0, 0)][DBLP ] Journal ] Vincenzo Auletta , Ioannis Caragiannis , Luisa Gargano , Christos Kaklamanis , Pino Persiano Sparse and limited wavelength conversion in all-optical tree networks. [Citation Graph (0, 0)][DBLP ] Journal ] Mila E. Majster-Cederbaum Underspecification for a simple process algebra of recursive processes. [Citation Graph (0, 0)][DBLP ] Journal ] Raymond Turner Type inference for set theory. [Citation Graph (0, 0)][DBLP ] Journal ] Thierry Joly Constant time parallel computations in lambda-calculus. [Citation Graph (0, 0)][DBLP ] Journal ] Thomas Krantz , Virgile Mogbil Encoding Hamiltonian circuits into multiplicative linear logic. [Citation Graph (0, 0)][DBLP ] Journal ] Dieter Spreen Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". [Citation Graph (0, 0)][DBLP ] Journal ] 