bibliographer - classic

On a Problem of Formal Logic F. P. Ramsey Fri 09 April 2021
New Results in Linear Filtering and Prediction Theory R. E. Kalman R. S. Bucy Sat 17 October 2020
A New Approach to Linear Filtering and Prediction Problems R. E. Kalman Sat 17 October 2020
The polynomial-time hierarchy Larry J. Stockmeyer Sun 23 February 2020
On the Algebra of Logic C. S. Peirce Tue 21 January 2020
Generalized first-order spectra and polynomial-time recognizable sets Ronald Fagin Mon 20 January 2020
Natural Semantics Gilles Kahn Tue 27 August 2019
The Problem of Solvability of Equations in a Free Semigroup G S Makanin Thu 08 August 2019
The typed łambda-calculus is not elementary recursive Richard Statman Wed 07 August 2019
A Taxonomy of Problems with Fast Parallel Algorithms Stephen A. Cook Sat 22 September 2018
Affine Relationships Among Variables of a Program Michael Karr Thu 19 July 2018
Equilibrium Points of Bimatrix Games C. E. Lemke J. T. Howson Thu 07 June 2018
The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis Paul W. Goldberg Christos H. Papadimitriou Wed 30 May 2018
The calculus of constructions Thierry Coquand Gérard Huet Tue 22 May 2018
Non-Cooperative Games John Nash Tue 15 May 2018
The Semantic Conception of Truth: and the Foundations of Semantics Alfred Tarski Tue 15 May 2018
A Formulation of the Simple Theory of Types Alonzo Church Wed 02 May 2018
Three Models for the Description of Language Noam Chomsky Wed 16 August 2017
Application of Recursive Arithmetic to the Problem of Circuit Synthesis Alonzo Church Sun 09 July 2017
Logic, Arithmetic, and Automata Alonzo Church Mon 03 July 2017
Computing machinery and intelligence Alan Turing Mon 03 July 2017
A Computing Procedure for Quantification Theory Martin Davis Hilary Putnam Wed 16 September 2015
The Abstract Theory of Automata V M Glushkov Thu 26 February 2015
General Theory of Natural Equivalences Samuel Eilenberg Saunders MacLane Sun 26 October 2014
Molecular Structure of Nucleic Acids J. D. Watson F. H. C. Crick Thu 16 October 2014
Time, Clocks, and the Ordering of Events in a Distributed System Leslie Lamport Sat 13 September 2014
Reaching Agreement in the Presence of Faults M. Pease R. Shostak L. Lamport Sat 13 September 2014
Comparative Schematology Michael S. Paterson Carl E. Hewitt Thu 11 September 2014
A characterization of the minimum cycle mean in a digraph Richard M. Karp Mon 18 August 2014
The equality problem for rational series with multiplicities in the tropical semiring is undecidable Daniel Krob Mon 18 August 2014
Infinite games played on finite graphs Robert McNaughton Mon 18 August 2014
Termination of Probabilistic Concurrent Program Sergiu Hart Micha Sharir Amir Pnueli Wed 30 July 2014
The Complexity of Relational Query Languages (Extended Abstract) Moshe Y. Vardi Tue 29 July 2014
Subgame-perfect equilibria of finite- and infinite-horizon games Drew Fudenberg David Levine Fri 06 June 2014
Translations on a Context Free Grammar A. V. Aho J. D. Ullman Sun 23 February 2014
On the Uniform Halting Problem for Term Rewriting Systems Gerard Huet Dallas Lankford Wed 29 January 2014
Adherences of languages Luc Boasson Maurice Nivat Tue 28 January 2014
Simple Word Problems in Universal Algebras D.E. Knuth P.B. Bendix Sat 25 January 2014
Rewrite, rewrite, rewrite, rewrite, rewrite, łdots Nachum Dershowitz Stéphane Kaplan David A. Plaisted Thu 23 January 2014
Stochastic Games With Perfect Information and Time Average Payoff Thomas M. Liggett Steven A. Lippman Mon 13 January 2014
The complexity of mean payoff games on graphs Uri Zwick Mike Paterson Mon 13 January 2014
Automatic presentations of structures Bakhadyr Khoussainov Anil Nerode Tue 24 December 2013
A helpful result for proving inherent ambiguity William Ogden Mon 23 December 2013
Learning Regular Sets from Queries and Counterexamples Dana Angluin Sun 22 December 2013
On formal properties of simple phrase structure grammars Yehoshua Bar-Hillel Micha A. Perles Eli Shamir Wed 18 December 2013
Progress measures, immediate determinacy, and a subset construction for tree automata Nils Klarlund Wed 18 December 2013
On a Decision Method in Restricted Second-Order Arithmetic Julius R. Buchi Thu 12 December 2013
An impossible program C. Strachey Wed 11 December 2013
Can Programming Be Liberated from the Von Neumann Style: A Functional Style and Its Algebra of Programs John Backus Mon 09 December 2013
The lattice of flow diagrams Dana Scott Mon 02 December 2013
Solution of a Problem in Concurrent Programming Control E. W. Dijkstra Mon 25 November 2013
The equivalence problem of multitape finite automata Tero Harju Juhani Karhumaki Wed 13 November 2013
Finitely additive stochastic games with Borel measurable payoffs A. Maitra W. Sudderth Tue 22 October 2013
A Transformation System for Developing Recursive Programs R. M. Burstall John Darlington Fri 06 September 2013
New directions in cryptography W. Diffie M. Hellman Tue 03 September 2013
The Byzantine Generals Problem Leslie Lamport Robert Shostak Marshall Pease Tue 27 August 2013
Deciding branching time logic E. Allen Emerson A. Prasad Sistla Fri 12 July 2013
On the synthesis of a reactive module A. Pnueli R. Rosner Fri 12 July 2013
On the complexity of omega-automata S. Safra Fri 12 July 2013
The Calculi of Lambda-Conversion Alonzo Church Tue 09 July 2013
Models of LCF Robin Milner Tue 09 July 2013
The next 700 programming languages P. J. Landin Tue 09 July 2013
The Principal Type-Scheme of an Object in Combinatory Logic R. Hindley Tue 09 July 2013
Fundamental Concepts in Programming Languages Christopher Strachey Tue 09 July 2013
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts Hans Bekic Mon 08 July 2013
Automatic computation of data set definitions John C. Reynolds Fri 28 June 2013
Reasoning about Idealized ALGOL Using Regular Languages Dan R. Ghica Guy McCusker Wed 01 May 2013
Predicate Logic as Programming Language Robert A. Kowalski Wed 17 April 2013
Intuitionistic propositional logic is polynomial-space complete Richard Statman Fri 05 April 2013
Towards Abstract Categorial Grammars Philippe de Groote Mon 01 April 2013
The mathematics of sentence structure Joachim Lambek Mon 01 April 2013
Checking a large routine A. Turing Wed 27 March 2013
Tree automata, Mu-Calculus and determinacy E. A. Emerson C. S. Jutla Wed 27 March 2013
A Structural Approach to Operational Semantics Gordon Plotkin Tue 26 March 2013
Structured operational semantics and bisimulation as a congruence Jan Friso Groote Frits Vaandrager Tue 26 March 2013
The mechanical evaluation of expressions Peter Landin Fri 01 March 2013
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems Gérard Huet Wed 27 February 2013
A theory of type polymorphism in programming Robin Milner Sun 24 February 2013
Decidability of higher-order matching Colin Stirling Tue 19 February 2013
The Undecidability of łambda-Definability Ralph Loader Fri 15 February 2013
Completeness in the Theory of Types Leon Henkin Thu 14 February 2013
An Efficient Unification Algorithm Alberto Martelli Ugo Montanari Tue 12 February 2013
Results on the propositional mu-calculus Dexter Kozen Wed 30 January 2013
Notions of computation and monads Eugenio Moggi Wed 30 January 2013
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic Edmund M. Clarke E. Allen Emerson Wed 30 January 2013
Counterexample-guided abstraction refinement for symbolic model checking Edmund Clarke Orna Grumberg Somesh Jha Yuan Lu Helmut Veith Wed 30 January 2013
Types, Abstraction and Parametric Polymorphism John C. Reynolds Wed 30 January 2013
Call-by-Name, Call-by-Value and the lambda-Calculus Gordon Plotkin Wed 30 January 2013
Programming languages, natural languages, and mathematics Peter Naur Sun 27 January 2013
Flow diagrams, turing machines and languages with only two formation rules Corrado Bøhm Giuseppe Jacopini Sun 27 January 2013
The Temporal Semantics of Concurrent Programs Amir Pnueli Sat 05 January 2013
A variant of a recursively unsolvable problem Emil L. Post Sun 30 December 2012
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) Moshe Y. Vardi Pierre Wolper Sat 29 December 2012
Power domains and predicate transformers: A topological view M. Smyth Sat 29 December 2012
Ordering by Divisibility in Abstract Algebras Graham Higman Sat 29 December 2012
Hybrid automata with finite bisimulations Thomas Henzinger Sat 29 December 2012
Checking that finite state concurrent programs satisfy their linear specification Orna Lichtenstein Amir Pnueli Sat 29 December 2012
Gedanken Experiments on Sequential Machines Edward F. Moore Sat 29 December 2012
Linear Automaton Transformations A. Nerode Sat 29 December 2012
The covering and boundedness problems for vector addition systems Charles Rackoff Tue 18 December 2012
Theorems for free Philip Wadler Fri 14 December 2012
Representation of events in nerve nets and finite automata S. C. Kleene Mon 10 December 2012
A logical calculus of the ideas immanent in nervous activity WarrenS. McCulloch Walter Pitts Mon 10 December 2012
An axiomatic proof technique for parallel programs I Susan Owicki David Gries Fri 07 December 2012
Stochastic Games Lloyd Shapley Thu 06 December 2012
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints Patrick Cousot Radhia Cousot Tue 04 December 2012
Logic, Arithmetic, and Automata Alonzo Church Mon 03 December 2012
Decision Problems of Finite Automata Design and Related Arithmetics Calvin C. Elgot Mon 03 December 2012
Weak second-order arithmetic and finite automata Richard Buchi Mon 03 December 2012
Well-structured transition systems everywhere A. Finkel Ph. Schnoebelen Tue 27 November 2012
Parallel program schemata Richard M. Karp Raymond E. Miller Fri 26 October 2012
A Linear Algorithm for Testing Equivalence of Finite Automata John Hopcroft Richard Karp Tue 02 October 2012
Separation Logic: A Logic for Shared Mutable Data Structures John C. Reynolds Tue 25 September 2012
Derivatives of Regular Expressions Janusz A. Brzozowski Fri 21 September 2012
Unreliable Channels Are Easier to Verify Than Perfect Channels Gerard Cece Alain Finkel S. Purushothaman Iyer Wed 04 July 2012
Fundamental properties of infinite trees Bruno Courcelle Mon 18 June 2012
Statecharts: A Visual Formalism for Complex Systems David Harel Mon 04 June 2012
Notes on Finite Asynchronous Automata Wieslaw Zielonka Sun 27 May 2012
Theories of automata on I-tapes: A simplified approach Yaacov Choueka Sun 27 May 2012
Monadic second-order logic on tree-like structures Igor Walukiewicz Sat 19 May 2012
Guarded commands, nondeterminacy and formal derivation of programs Edsger W. Dijkstra Mon 14 May 2012
The monadic second-order logic of graphs IX: Machines and their behaviours Bruno Courcelle Fri 27 April 2012
Communicating sequential processes C. A. R. Hoare Thu 19 April 2012
Soundness and Completeness of an Axiom System for Program Verification Stephen A. Cook Sun 15 April 2012
Fully abstract models of typed lambda-calculi Robin Milner Thu 12 April 2012
Assigning meanings to programs RW Floyd Thu 12 April 2012
An axiomatic basis for computer programming C. A. R. Hoare Mon 09 April 2012
A Mathematical Theory of Communication Claude E. Shannon Mon 09 April 2012
Reasoning about infinite computations Moshe Y. Vardi Pierre Wolper Wed 04 April 2012
Decidability of second-order theories and automata on infinite trees Michael O. Rabin Mon 12 March 2012
Finite automata and their decision problems Michael O. Rabin Dana Scott Mon 12 March 2012
Decision problems for omega-automata L. H. Landweber Wed 07 March 2012
LCF considered as a programming language Gordon Plotkin Tue 06 March 2012
The IO- and OI-hierarchies Werner Damm Tue 06 March 2012

Library Size: 13G (134 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]