Find link

language:

Find link is a tool written by Edward Betts.

searching for Electronic Notes in Theoretical Computer Science 77 found (94 total)

alternate case: electronic Notes in Theoretical Computer Science

Workshop on Logic, Language, Information and Computation (2,677 words) [view diff] exact match in snippet view article find links to article

18–21 July 2006. Edited by G. Mints and R. de Queiroz. Electronic Notes in Theoretical Computer Science. ISSN 1571-0661. Volume 165, Pages 1–226 (22 November

Ted Hurley (1,428 words) [view diff] exact match in snippet view article find links to article

Michel Schellekens and Anthony Seda. Elsevier Science (Electronic Notes in Theoretical Computer Science, Vol 40) The Second Irish Conference on the Mathematical

Lawson topology (142 words) [view diff] exact match in snippet view article find links to article

University Press. ISBN 0-521-80338-1 "How Do Domains Model Topologies?," Paweł Waszkiewicz, Electronic Notes in Theoretical Computer Science 83 (2004) v t e

Maude system (770 words) [view diff] exact match in snippet view article find links to article

Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science 15, Elsevier. Martí-Oliet and José Meseguer, 2002.

Lawvere theory (286 words) [view diff] exact match in snippet view article find links to article

Universal Algebra: Lawvere Theories and Monads" (PDF), Electronic Notes in Theoretical Computer Science, 172 (Computation, Meaning, and Logic: Articles dedicated

Ruy de Queiroz (1,250 words) [view diff] exact match in snippet view article find links to article

Sciences, Fundamenta Informaticae, several volumes of Electronic Notes in Theoretical Computer Science; Creator and prime organizer of the series of workshops

Categorical quantum mechanics (2,203 words) [view diff] exact match in snippet view article find links to article

are complete for dagger compact closed categories". Electronic Notes in Theoretical Computer Science. 270 (1): 113–9. CiteSeerX 10.1.1.749.4436. doi:10

Interactive computing (659 words) [view diff] exact match in snippet view article find links to article

"Programming Languages For Interactive Computing". Electronic Notes in Theoretical Computer Science. Proceedings of the Workshop on the Foundations of

Reversed compound agent theorem (224 words) [view diff] exact match in snippet view article find links to article

G. (2006). "Process Algebraic Non-product-forms". Electronic Notes in Theoretical Computer Science. 151 (3): 61–76. doi:10.1016/j.entcs.2006.03.012. Harrison

Protocol composition logic (154 words) [view diff] exact match in snippet view article find links to article

(April 2007). "Protocol Composition Logic (PCL)". Electronic Notes in Theoretical Computer Science. 172: 311–358. doi:10.1016/j.entcs.2007.02.012. ISSN 1571-0661

Dagger compact category (2,010 words) [view diff] exact match in snippet view article find links to article

and completely positive maps: (Extended Abstract)". Electronic Notes in Theoretical Computer Science. 170 (Proceedings of the 3rd International Workshop

Richard Statman (249 words) [view diff] exact match in snippet view article find links to article

Think of Intersection Types as Cartesian Products". Electronic Notes in Theoretical Computer Science. 325: 305–312. doi:10.1016/j.entcs.2016.09.045. Barendregt

Calculus of communicating systems (785 words) [view diff] exact match in snippet view article find links to article

a Java Orchestration Language Interpreter Engine". Electronic Notes in Theoretical Computer Science. Combined Proceedings of the Second International Workshop

Model transformation language (769 words) [view diff] exact match in snippet view article find links to article

and Van Gorp, P: A Taxonomy of Model Transformation, Electronic Notes in Theoretical Computer Science, Volume 152, 27 March 2006, Pages 125-142 Czarnecki

Impro-Visor (1,155 words) [view diff] exact match in snippet view article find links to article

Abstractions for a Jazz Improvisation Assistant". Electronic Notes in Theoretical Computer Science. 193 (193): 47–60. doi:10.1016/j.entcs.2007.10.007

Semantic Web Rule Language (1,031 words) [view diff] exact match in snippet view article find links to article

(2006). "Interpreting SWRL Rules in RDF Graphs" (PDF). Electronic Notes in Theoretical Computer Science. 151 (2). Elsevier: 53–69. doi:10.1016/j.entcs.2005

Minimum k-cut (847 words) [view diff] exact match in snippet view article find links to article

Parameterised Complexity of k-Cut and Related Problems". Electronic Notes in Theoretical Computer Science. CATS'03, Computing: the Australasian Theory Symposium

E (theorem prover) (937 words) [view diff] exact match in snippet view article

Proving to Debugging and Verifying Pointer Programs". Electronic Notes in Theoretical Computer Science. 86 (1). 4th International Workshop on First-Order

Gordon Plotkin (786 words) [view diff] exact match in snippet view article find links to article

Logical Relations for Polymorphic and Recursive Types". Electronic Notes in Theoretical Computer Science. 172: 259. doi:10.1016/j.entcs.2007.02.010. Curien

Alternating-time temporal logic (520 words) [view diff] exact match in snippet view article find links to article

(2004-04-01). "Alternating-time logic with imperfect recall". Electronic Notes in Theoretical Computer Science. LCMAS 2003, Logic and Communication in Multi-Agent

Gunther Schmidt (1,094 words) [view diff] exact match in snippet view article find links to article

) Relational Methods in Software, Special Issue of Electronic Notes in Theoretical Computer Science,, vol. 44, numbers 3, ISSN 1571-0661 1999: (with Jaoua

Comparison of parser generators (1,128 words) [view diff] exact match in snippet view article find links to article

ScalaBison Recursive Ascent-Descent Parser Generator". Electronic Notes in Theoretical Computer Science. Proceedings of the Ninth Workshop on Language Descriptions

Dagger symmetric monoidal category (498 words) [view diff] exact match in snippet view article find links to article

and completely positive maps: (Extended Abstract)". Electronic Notes in Theoretical Computer Science. 170 (Proceedings of the 3rd International Workshop

Alan Mycroft (472 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-540-09981-9. Nethercote, N.; Mycroft, A. (2003). "Redux". Electronic Notes in Theoretical Computer Science. 89 (2): 149. doi:10.1016/S1571-0661(04)81047-8. Mycroft

Spec Explorer (517 words) [view diff] exact match in snippet view article find links to article

Workshop on Model Based Testing (MBT 2004), volume 111 of Electronic Notes in Theoretical Computer Science. Elsevier, 2004. Wolfgang Grieskamp, Nicolas Kicillof

Persistent environment (450 words) [view diff] exact match in snippet view article find links to article

Foundations of Interactive Computation (FInCo 2005). Electronic Notes in Theoretical Computer Science. Vol. 141. pp. 163–179. doi:10.1016/j.entcs.2005.05

Jay Freeman (1,180 words) [view diff] exact match in snippet view article find links to article

Runtime Event Specification and Monitoring Library". Electronic Notes in Theoretical Computer Science. 113. Elsevier: 181–200. doi:10.1016/j.entcs.2004.01

Diagrammatic reasoning (1,824 words) [view diff] exact match in snippet view article find links to article

Systems Based on Euler Diagrams[permanent dead link]. Electronic Notes in Theoretical Computer Science. 2005. Diagrammatic Reasoning Site Archived 2009-06-19

Steve Vickers (computer scientist) (1,226 words) [view diff] exact match in snippet view article

of Programming Semantics (MFPS XXIV), pp. 209–229, Electronic Notes in Theoretical Computer Science, Elsevier, 2008. Steven Vickers, "Cosheaves and connectedness

ELAN (programming language) (238 words) [view diff] exact match in snippet view article

Ringeissen, Christophe (1998). "An Overview of ELAN". Electronic Notes in Theoretical Computer Science. 15: 55–70. doi:10.1016/s1571-0661(05)82552-6. ISSN 1571-0661

Setoid (532 words) [view diff] exact match in snippet view article find links to article

Closed Categories—an Intuitionistic Perspective", Electronic Notes in Theoretical Computer Science 218 (2008) 21–32. "Bishop's set theory" (PDF). p. 9

List of undecidable problems (1,586 words) [view diff] exact match in snippet view article find links to article

of Definition is Undecidable for Polynomial ODEs". Electronic Notes in Theoretical Computer Science. 202: 49–57. doi:10.1016/j.entcs.2008.03.007. hdl:10400

Nancy D. Griffeth (869 words) [view diff] exact match in snippet view article find links to article

Self-Similar Networks," electronically published in Electronic Notes in Theoretical Computer Science, 2006 Nancy Griffeth at Lehman College 2014 NSF-CMACS

Sierpiński space (1,913 words) [view diff] exact match in snippet view article find links to article

Synthetic topology of data types and classical spaces. Electronic Notes in Theoretical Computer Science. Vol. 87. Elsevier. p. 2004. CiteSeerX 10.1.1.129.2886

Multilinear polynomial (1,271 words) [view diff] exact match in snippet view article find links to article

"The Interval Analysis of Multilinear Expressions". Electronic Notes in Theoretical Computer Science. 267 (2): 43–53. doi:10.1016/j.entcs.2010.09.017. ISSN 1571-0661

Earley parser (1,587 words) [view diff] exact match in snippet view article find links to article

2008). "SPPF-Style Parsing From Earley Recognizers". Electronic Notes in Theoretical Computer Science. 203 (2): 53–67. doi:10.1016/j.entcs.2008.03.044. Aycock

Ambiguous grammar (1,804 words) [view diff] exact match in snippet view article find links to article

2008). "SPPF-Style Parsing From Earley Recognizers". Electronic Notes in Theoretical Computer Science. 203 (2): 53–67. doi:10.1016/j.entcs.2008.03.044. Tomita

Parser combinator (1,678 words) [view diff] exact match in snippet view article find links to article

(2001). "Combinator parsers: From toys to tools". Electronic Notes in Theoretical Computer Science. 41: 38–59. doi:10.1016/S1571-0661(05)80545-6. Wadler

Premonoidal category (644 words) [view diff] exact match in snippet view article find links to article

(1998). "Premonoidal categories and flow graphs". Electronic Notes in Theoretical Computer Science. 10: 51. doi:10.1016/s1571-0661(05)80688-7. ISSN 1571-0661

Extended static checking (933 words) [view diff] exact match in snippet view article find links to article

Applications with Extended Static Checking: A Case Study". Electronic Notes in Theoretical Computer Science. 157 (2): 119–132. doi:10.1016/j.entcs.2005.12.050

Arrow (computer science) (1,556 words) [view diff] exact match in snippet view article

March 2011). "What is a Categorical Model of Arrows?". Electronic Notes in Theoretical Computer Science. 229 (5): 19–37. doi:10.1016/j.entcs.2011.02.014. ISSN 1571-0661

Graph rewriting (1,815 words) [view diff] exact match in snippet view article find links to article

Heckel, R. (2006). Graph transformation in a nutshell. Electronic Notes in Theoretical Computer Science 148 (1 SPEC. ISS.), pp. 187–198. König, Barbara (2004)

Isbell duality (1,478 words) [view diff] exact match in snippet view article find links to article

"Broadening the denotational semantics of linear logic", Electronic Notes in Theoretical Computer Science, 3: 155–166, doi:10.1016/S1571-0661(05)80415-3 Riehl

Formal methods (3,643 words) [view diff] exact match in snippet view article find links to article

verification of fault-tolerant register emulations", Electronic Notes in Theoretical Computer Science, vol. 149, no. 1, pp. 49–60. K. D. Schubert, W. Roesner

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

"Monitoring Java Programs with Java PathExplorer". Electronic Notes in Theoretical Computer Science. RV'2001, Runtime Verification (in connection with

Code as data (728 words) [view diff] exact match in snippet view article find links to article

(March 2006). "Generic Pickling and Minimization". Electronic Notes in Theoretical Computer Science. 148 (2): 79–103. doi:10.1016/j.entcs.2005.11.041.

Christoph Walther (1,363 words) [view diff] exact match in snippet view article find links to article

Dependent Procedures and Computed Types in VeriFun". Electronic Notes in Theoretical Computer Science. 174 (7): 61–78. doi:10.1016/j.entcs.2006.10.038. Christoph

Actor model later history (1,443 words) [view diff] exact match in snippet view article find links to article

Carolyn Talcott. Can Actors and Pi-Agents Live Together? Electronic Notes in Theoretical Computer Science. 1998. - M. Gaspari and G. Zavattaro: An Algebra of

Constraint Handling Rules (1,883 words) [view diff] exact match in snippet view article find links to article

"Type inference using constraint handling rules." Electronic Notes in Theoretical Computer Science 64 (2002): 56-72. Sneyers, Jon; Van Weert, Peter; Schrijvers

Clone (algebra) (1,091 words) [view diff] exact match in snippet view article

Wingfield, Cai (eds.). "Clones with Nullary Operations". Electronic Notes in Theoretical Computer Science. 303: 3–35. doi:10.1016/j.entcs.2014.02.002. ISSN 1571-0661

Pure type system (1,168 words) [view diff] exact match in snippet view article find links to article

(1997). "A Notion of Classical Pure Type System". Electronic Notes in Theoretical Computer Science. 6: 4–59. CiteSeerX 10.1.1.32.1371. doi:10.1016/S1571-0661(05)80170-7

Reduction strategy (2,608 words) [view diff] exact match in snippet view article find links to article

(November 2001). "A Logic for Rewriting Strategies". Electronic Notes in Theoretical Computer Science. 58 (2): 138–154. doi:10.1016/S1571-0661(04)00283-X

Actor model and process calculi history (2,420 words) [view diff] exact match in snippet view article find links to article

Carolyn Talcott. Can Actors and Pi-Agents Live Together? Electronic Notes in Theoretical Computer Science. 1998. Carl Hewitt. Viewing Control Structures as Patterns

Denotational semantics (3,784 words) [view diff] exact match in snippet view article find links to article

Pierre-Louis (2007). "Definability and Full Abstraction". Electronic Notes in Theoretical Computer Science. 172: 301–310. doi:10.1016/j.entcs.2007.02.011. Milner

Multi-label classification (3,048 words) [view diff] exact match in snippet view article find links to article

Methods using the Problem Transformation Approach". Electronic Notes in Theoretical Computer Science. 292: 135–151. doi:10.1016/j.entcs.2013.02.010. ISSN 1571-0661

Courcelle's theorem (3,146 words) [view diff] exact match in snippet view article find links to article

(2009), "A practical approach to Courcelle's theorem", Electronic Notes in Theoretical Computer Science, 251: 65–81, doi:10.1016/j.entcs.2009.08.028. Lampis

E-graph (2,143 words) [view diff] exact match in snippet view article find links to article

R. (2008-05-06). "E-matching for Fun and Profit". Electronic Notes in Theoretical Computer Science. Proceedings of the 5th International Workshop on Satisfiability

Spekkens toy model (2,625 words) [view diff] exact match in snippet view article find links to article

(2011). "Toy Quantum Categories (Extended Abstract)". Electronic Notes in Theoretical Computer Science. 270 (1): 29–40. doi:10.1016/j.entcs.2011.01.004. Ladina

Secret sharing using the Chinese remainder theorem (2,222 words) [view diff] exact match in snippet view article find links to article

Chinese Remainder Theorem with Applications in E-Voting. Electronic Notes in Theoretical Computer Science (ENTCS). Volume 186, (July 2007). Pages 67–84. Year

K-trivial set (1,837 words) [view diff] exact match in snippet view article find links to article

Hirschfeldt, Andr ́e Nies, Frank Stephan, "Trivial Reals", Electronic Notes in Theoretical Computer Science 66 No. 1 (2002), URL: "Elsevier.nl - de pagina kan

Patrick Lincoln (2,273 words) [view diff] exact match in snippet view article find links to article

of maude, M Clavel, S Eker, P Lincoln, J Meseguer, Electronic Notes in Theoretical Computer Science 4, 65-89, 1996 cited 294 Undecidability of bounded

Maximum subarray problem (2,467 words) [view diff] exact match in snippet view article find links to article

subarray problem by distance matrix multiplication", Electronic Notes in Theoretical Computer Science, 61: 191–200, doi:10.1016/S1571-0661(04)00313-5. Tamaki

Classification Tree Method (2,339 words) [view diff] exact match in snippet view article find links to article

for Embedded Systems for the Description of Events". Electronic Notes in Theoretical Computer Science. 164 (4): 3–11. doi:10.1016/j.entcs.2006.09.002. Lehmann

Garden of Eden (cellular automaton) (3,537 words) [view diff] exact match in snippet view article

on Cellular Automata and Discrete Complex Systems, Electronic Notes in Theoretical Computer Science, vol. 252, pp. 93–102, doi:10.1016/j.entcs.2009.09

UML-RSDS (1,195 words) [view diff] exact match in snippet view article find links to article

Transformations: A Survey of the State-of-the-Art". Electronic Notes in Theoretical Computer Science. 292: 5–25. doi:10.1016/j.entcs.2013.02.002. Kahani

Actor model and process calculi (3,220 words) [view diff] exact match in snippet view article find links to article

Carolyn Talcott. Can Actors and Pi-Agents Live Together? Electronic Notes in Theoretical Computer Science. 1998. Robin Milner. Communicating and Mobile Systems:

Category of Markov kernels (1,557 words) [view diff] exact match in snippet view article find links to article

Prakash (1999). "The category of Markov kernels". Electronic Notes in Theoretical Computer Science. 22: 171–187. doi:10.1016/S1571-0661(05)80602-4. Riehl

Datalog (4,901 words) [view diff] exact match in snippet view article find links to article

Saenz-Perez (2011), "DES: A Deductive Database System", Electronic Notes in Theoretical Computer Science, 271, ES: 63–78, doi:10.1016/j.entcs.2011.02.011. Differential

Cyclic order (6,392 words) [view diff] exact match in snippet view article find links to article

(April 2008), "Cyclic extensions of order varieties", Electronic Notes in Theoretical Computer Science, 212: 119–132, doi:10.1016/j.entcs.2008.04.057 Knuth

Parity of zero (7,501 words) [view diff] exact match in snippet view article find links to article

"A Bidirectional Refinement Type System for LF", Electronic Notes in Theoretical Computer Science, 196: 113–128, doi:10.1016/j.entcs.2007.09.021 Lovász

Ethics in mathematics (3,008 words) [view diff] exact match in snippet view article find links to article

Patrick F. (2006). "Ascertaining Mathematical Theorems". Electronic Notes in Theoretical Computer Science. 151 (1): 21–38. doi:10.1016/j.entcs.2005.11.021. hdl:20

Lambda calculus (11,994 words) [view diff] exact match in snippet view article find links to article

2018). "(In)Efficiency and Reasonable Cost Models". Electronic Notes in Theoretical Computer Science. 338: 23–43. doi:10.1016/j.entcs.2018.10.003. Asperti

Monad (functional programming) (9,312 words) [view diff] exact match in snippet view article

Varmo (June 2008). "Comonadic Notions of Computation". Electronic Notes in Theoretical Computer Science. 203 (5). Elsevier: 263–284. doi:10.1016/j.entcs.2008

Axiomatic foundations of topological spaces (4,693 words) [view diff] exact match in snippet view article find links to article

(August 2019). "Generalizing Topological Set Operators". Electronic Notes in Theoretical Computer Science. 345: 63–76. doi:10.1016/j.entcs.2019.07.016. ISSN 1571-0661

Curry–Howard correspondence (6,375 words) [view diff] exact match in snippet view article find links to article

Functional Interpretation of Direct Computations", Electronic Notes in Theoretical Computer Science, 269, Elsevier: 19–40, doi:10.1016/j.entcs.2011.03

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

Workshop on Rule-Based Programming (RULE 2001). Vol. 59. Electronic Notes in Theoretical Computer Science. doi:10.7146/brics.v9i4.21721. Danvy, Olivier; Nielsen

Parameterized approximation algorithm (3,354 words) [view diff] exact match in snippet view article find links to article

Parameterised Complexity of k-Cut and Related Problems". Electronic Notes in Theoretical Computer Science. CATS'03, Computing: the Australasian Theory Symposium