Find link

language:

Find link is a tool written by Edward Betts.

searching for Logical Methods in Computer Science 37 found (63 total)

alternate case: logical Methods in Computer Science

Explicit substitution (713 words) [view diff] exact match in snippet view article find links to article

Reasoning with Guarded Recursion for Coinductive Types". Logical Methods in Computer Science. 12 (3): 36. arXiv:1606.09455. doi:10.2168/LMCS-12(3:7)2016

Category of finite-dimensional Hilbert spaces (221 words) [view diff] exact match in snippet view article find links to article

spaces are complete for dagger compact closed categories". Logical Methods in Computer Science. 8 (3). arXiv:1207.6972. CiteSeerX 10.1.1.749.4436. doi:10

David J. Foulis (476 words) [view diff] exact match in snippet view article find links to article

lattices, Foulis semigroups and dagger kernel categories", Logical Methods in Computer Science, 6 (2): 2:1, 26, arXiv:0905.4090, doi:10.2168/LMCS-6(2:1)2010

Nonelementary problem (458 words) [view diff] exact match in snippet view article find links to article

Leonid (2006), "Logics for unranked trees: an overview", Logical Methods in Computer Science, 2 (3): 3:2, 31, arXiv:cs.LO/0606062, doi:10.2168/LMCS-2(3:2)2006

Certificate (complexity) (671 words) [view diff] exact match in snippet view article

Yakaryılmaz, "Finite state verifiers with constant randomness," Logical Methods in Computer Science, Vol. 10(3:6)2014, pp. 1-17. Arora, Sanjeev; Barak, Boaz

Session type (898 words) [view diff] exact match in snippet view article find links to article

Neykova, Rumyana (29 March 2017). "Multiparty Session Actors". Logical Methods in Computer Science. 13 (1). arXiv:1609.05687. doi:10.23638/LMCS-13(1:17)2017

Pebble automaton (690 words) [view diff] exact match in snippet view article find links to article

Pebbles Capture First-Order Logic with Transitive Closure". Logical Methods in Computer Science. 3 (2). arXiv:cs/0703079. doi:10.2168/LMCS-3(2:3)2007.

Opa (programming language) (663 words) [view diff] exact match in snippet view article

Binsztok (2011). "TRX: A Formally Verified Parser Interpreter". Logical Methods in Computer Science. "Opa, un nouveau langage pour le développement d'applications

Choreographic programming (1,546 words) [view diff] exact match in snippet view article find links to article

(2017). "Dynamic Choreographies: Theory and Implementation". Logical Methods in Computer Science. 13 (2). arXiv:1611.09067. doi:10.23638/LMCS-13(2:1)2017

Matita (533 words) [view diff] exact match in snippet view article find links to article

Algorithm for the Calculus of (Co)Inductive Constructions" Logical Methods in Computer Science, V.8, n. 1 Andrea Asperti, Wilmer Ricciotti, C Sacerdoti

Egon Börger (642 words) [view diff] case mismatch in snippet view article find links to article

Academia Europaea. Egon Börger is a pioneer of applying logical methods in computer science. He is co-founder of the international conference series

NL (complexity) (1,570 words) [view diff] exact match in snippet view article

Yakaryılmaz, "Finite state verifiers with constant randomness," Logical Methods in Computer Science, Vol. 10(3:6)2014, pp. 1-17. Complexity Zoo: NL Papadimitriou

Helmut Veith (630 words) [view diff] exact match in snippet view article find links to article

served as the speaker of the FWF-funded Doctoral College on Logical Methods in Computer Science and as the deputy coordinator of the National Research Network

Universal differential equation (696 words) [view diff] exact match in snippet view article find links to article

(2020-02-28). "A Universal Ordinary Differential Equation". Logical Methods in Computer Science. 16 (1). arXiv:1702.08328. doi:10.23638/LMCS-16(1:28)2020

Samson Abramsky (1,187 words) [view diff] case mismatch in snippet view article find links to article

2001. Volume 5: Logic and Algebraic Methods. Volume 6: Logical methods in computer science. Abramsky has published over two hundred publications and

JoCaml (545 words) [view diff] exact match in snippet view article find links to article

Luc (2008). "Algebraic Pattern Matching in Join Calculus". Logical Methods in Computer Science. 4 (1). arXiv:0802.4018. Bibcode:2008arXiv0802.4018M. doi:10

Cem Say (491 words) [view diff] exact match in snippet view article find links to article

Yakaryılmaz, "Finite state verifiers with constant randomness," Logical Methods in Computer Science, Vol. 10(3:6)2014, pp. 1-17. H. Gökalp Demirci, A. C. Cem

Yuri Gurevich (836 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines and the Characterization Theorem. Logical Methods in Computer Science 3(4), 2007, paper 4. "Google Patents". A. Blass, Y. Gurevich

S2S (mathematics) (4,618 words) [view diff] exact match in snippet view article

functional (monadic) second-order theory of infinite trees". Logical Methods in Computer Science. 16 (4). arXiv:1903.05878. doi:10.23638/LMCS-16(4:6)2020

Grigore Roșu (1,229 words) [view diff] exact match in snippet view article find links to article

2012, Semantics and Algorithms for Parametric Monitoring Logical Methods in Computer Science (LMCS), vol. 8(1), pp. 1–47. P. Meredith, D. Jin, F. Chen

String diagram (3,699 words) [view diff] exact match in snippet view article find links to article

string diagrams and a quadratic equivalence algorithm". Logical Methods in Computer Science. 18. Selinger, Peter (2010), "A survey of graphical languages

Nested word (3,063 words) [view diff] exact match in snippet view article find links to article

(ed.). "First-Order and Temporal Logics for Nested Words". Logical Methods in Computer Science. 4 (4). arXiv:0811.0537. doi:10.2168/LMCS-4(4:11)2008. S2CID 220091601

Intermediate value theorem (4,359 words) [view diff] exact match in snippet view article find links to article

Choices for the Approximate Intermediate Value Theorem". Logical Methods in Computer Science. 16 (3). arXiv:1701.02227. doi:10.23638/LMCS-16(3:5)2020

Square-root sum problem (1,436 words) [view diff] exact match in snippet view article find links to article

Mihalis (2008-11-11). "Recursive Concurrent Stochastic Games". Logical Methods in Computer Science. 4 (4). arXiv:0810.3581. doi:10.2168/LMCS-4(4:7)2008. ISSN 1860-5974

Constraint satisfaction problem (3,363 words) [view diff] exact match in snippet view article find links to article

Dichotomy for First-Order Reducts of Unary Structures", Logical Methods in Computer Science, 14 (2), arXiv:1601.04520, doi:10.23638/LMCS-14(2:13)2018

CEK Machine (1,845 words) [view diff] exact match in snippet view article find links to article

deconstruction of Landin's SECD machine with the J operator". Logical Methods in Computer Science. 4 (4): 1–67. arXiv:0811.3231. doi:10.2168/LMCS-4(4:12)2008

Giorgi Japaridze (2,628 words) [view diff] exact match in snippet view article find links to article

Japaridze, "On the system CL12 of computability logic". Logical Methods in Computer Science (in press). W. Xu, "A propositional system induced by Japaridze's

Halting problem (7,356 words) [view diff] exact match in snippet view article find links to article

algorithms for halting problem and optimal machines revisited". Logical Methods in Computer Science. 12 (2): 1. arXiv:1505.00731. doi:10.2168/LMCS-12(2:1)2016

Rose tree (3,120 words) [view diff] exact match in snippet view article find links to article

flexible coinductive definitions by inference systems". Logical Methods in Computer Science. 15. arXiv:1808.02943. doi:10.23638/LMCS-15(1:26)2019. S2CID 51955443

Free abelian group (6,773 words) [view diff] exact match in snippet view article find links to article

Jens-Wolfhard (2013), "On characterising distributability", Logical Methods in Computer Science, 9 (3): 3:17, 58, arXiv:1309.3883, doi:10.2168/LMCS-9(3:17)2013

Matching logic (2,519 words) [view diff] exact match in snippet view article find links to article

Urbana-Champaign. Rosu, Grigore (2017-12-20). "Matching Logic". Logical Methods in Computer Science. 13 (4). doi:10.23638/LMCS-13(4:28)2017. ISSN 1860-5974.

Intersection type discipline (2,305 words) [view diff] exact match in snippet view article find links to article

"The algebraic intersection type unification problem". Logical Methods in Computer Science. 13 (3). arXiv:1611.05672. doi:10.23638/LMCS-13(3:9)2017

Busy beaver (7,914 words) [view diff] exact match in snippet view article find links to article

"Problems in number theory from busy beaver competition". Logical Methods in Computer Science. 11 (4): 10. Chaitin, Gregory J. (1987). "Computing the Busy

Unification (computer science) (7,390 words) [view diff] exact match in snippet view article

December 2021). "Efficient Full Higher-Order Unification". Logical Methods in Computer Science. 17 (4): 6919. arXiv:2011.09507. doi:10.46298/lmcs-17(4:18)2021

Interference freedom (5,613 words) [view diff] exact match in snippet view article find links to article

the theory of Owicki and Gries with a logic of progress". Logical Methods in Computer Science. 2. Centre pour la Communication Scientifique Directe (CCSD)

Refocusing (semantics) (2,786 words) [view diff] exact match in snippet view article

deconstruction of Landin's SECD machine with the J operator". Logical Methods in Computer Science. 4 (4): 1–67. arXiv:0811.3231. doi:10.2168/LMCS-4(4:12)2008

Word equation (4,051 words) [view diff] exact match in snippet view article find links to article

Counter Systems, and Presburger Arithmetic with Divisibility". Logical Methods in Computer Science. 17 (4). arXiv:2007.15478. doi:10.46298/lmcs-17(4:4)2021