Contente, Michele; Maietti, Maria Emilia The compatibility of the minimalist foundation with homotopy type theory. (English) Zbl 07811876 Theor. Comput. Sci. 991, Article ID 114421, 30 p. (2024). MSC: 03-XX × Cite Format Result Cite Review PDF Full Text: DOI arXiv OA License
Cantone, Domenico; Maugeri, Pietro; Omodeo, Eugenio G. Complexity assessments for decidable fragments of set theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. (English) Zbl 07673768 Theor. Comput. Sci. 954, Article ID 113786, 21 p. (2023). MSC: 03E30 03B25 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI OA License
Bereg, S.; Díaz-Báñez, J. M.; Haghpanah, M.; Horn, P.; Lopez, M. A.; Marín, N.; Ramírez-Vigueras, A.; Rodríguez, F.; Solé-Pi, O.; Stevens, A.; Urrutia, J. Optimal placement of base stations in border surveillance using limited capacity drones. (English) Zbl 1540.90143 Theor. Comput. Sci. 928, 183-196 (2022). MSC: 90B80 68U05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Daescu, Ovidiu; Malik, Hemant New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision. (English) Zbl 1517.68403 Theor. Comput. Sci. 882, 63-76 (2021). MSC: 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Cantone, Domenico; Maugeri, Pietro; Omodeo, Eugenio G. Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership. (English) Zbl 1498.03113 Theor. Comput. Sci. 848, 28-46 (2020). MSC: 03E30 03B25 03B35 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Mahdavi, Salma Sadat; Ghodsi, Mohammad Clearing an orthogonal polygon to find the evaders. (English) Zbl 1464.68403 Theor. Comput. Sci. 847, 175-184 (2020). MSC: 68T40 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Mahdavi, Salma Sadat; Seddighin, Saeed; Ghodsi, Mohammad Covering orthogonal polygons with sliding \(k\)-transmitters. (English) Zbl 1433.68497 Theor. Comput. Sci. 815, 163-181 (2020). MSC: 68U05 68Q17 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele Approximation algorithms for decomposing octilinear polygons. (English) Zbl 1426.68270 Theor. Comput. Sci. 779, 17-36 (2019). Reviewer: Agnieszka Lisowska (Sosnowiec) MSC: 68U05 68Q17 68U07 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Khodakarami, Farnoosh; Didehvar, Farzad; Mohades, Ali 1.5D terrain guarding problem parameterized by guard range. (English) Zbl 1356.68088 Theor. Comput. Sci. 661, 65-69 (2017). MSC: 68Q17 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Khodakarami, Farnoosh; Didehvar, Farzad; Mohades, Ali A fixed-parameter algorithm for guarding 1.5D terrains. (English) Zbl 1328.68262 Theor. Comput. Sci. 595, 130-142 (2015). MSC: 68U05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Dereniowski, Dariusz; Ono, Hirotaka; Suzuki, Ichiro; Wrona, Łukasz; Yamashita, Masafumi; Żyliński, Paweł The searchlight problem for road networks. (English) Zbl 1322.68214 Theor. Comput. Sci. 591, 28-59 (2015). MSC: 68U05 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Cantone, Domenico; Longo, Cristiano A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions. (English) Zbl 1329.03045 Theor. Comput. Sci. 560, Part 3, 307-325 (2014). Reviewer: J. M. Plotkin (East Lansing) MSC: 03B25 03E30 × Cite Format Result Cite Review PDF Full Text: DOI
Milanič, Martin; Rizzi, Romeo; Tomescu, Alexandru I. Set graphs. II. Complexity of set graph recognition and similar problems. (English) Zbl 1298.05146 Theor. Comput. Sci. 547, 70-81 (2014). MSC: 05C20 05C62 05C69 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Curien, Pierre-Louis; Garner, Richard; Hofmann, Martin Revisiting the categorical interpretation of dependent type theory. (English) Zbl 1433.03029 Theor. Comput. Sci. 546, 99-119 (2014). MSC: 03B38 18D15 × Cite Format Result Cite Review PDF Full Text: DOI
Tan, Xuehou; Jiang, Bo Minimization of the maximum distance between the two guards patrolling a polygonal region. (English) Zbl 1417.68252 Theor. Comput. Sci. 532, 73-79 (2014). MSC: 68U05 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Capretta, Venanzio Coalgebras in functional programming and type theory. (English) Zbl 1225.68057 Theor. Comput. Sci. 412, No. 38, 5006-5024 (2011). MSC: 68N18 03B70 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI
Curien, Pierre-Louis Preface to the special volume. (English, French) Zbl 1213.03043 Theor. Comput. Sci. 412, No. 20, 1853-1859 (2011). MSC: 03B70 03F52 68N30 × Cite Format Result Cite Review PDF Full Text: DOI
Brimkov, Valentin E.; Leach, Andrew; Mastroianni, Michael; Wu, Jimmy Guarding a set of line segments in the plane. (English) Zbl 1207.68414 Theor. Comput. Sci. 412, No. 15, 1313-1324 (2011). MSC: 68U05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
O’Connor, Russell; Spitters, Bas A computer-verified monadic functional implementation of the integral. (English) Zbl 1209.68108 Theor. Comput. Sci. 411, No. 37, 3386-3402 (2010). MSC: 68N18 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bhattacharya, Binay; Burmester, Mike; Hu, Yuzhuang; Kranakis, Evangelos; Shi, Qiaosheng; Wiese, Andreas Optimal movement of mobile sensors for barrier coverage of a planar region. (English) Zbl 1192.68816 Theor. Comput. Sci. 410, No. 52, 5515-5528 (2009). MSC: 68W05 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Amato, Gianluca; Lipton, James; McGrail, Robert On the algebraic structure of declarative programming languages. (English) Zbl 1187.68121 Theor. Comput. Sci. 410, No. 46, 4626-4671 (2009). MSC: 68N17 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Zhi-Zhong; Tanahashi, Ruka Approximating maximum edge 2-coloring in simple graphs via local improvement. (English) Zbl 1187.68338 Theor. Comput. Sci. 410, No. 45, 4543-4553 (2009). MSC: 68R10 68W25 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Gambino, Nicola; Garner, Richard The identity type weak factorisation system. (English) Zbl 1157.68022 Theor. Comput. Sci. 409, No. 1, 94-109 (2008). MSC: 68N18 68N30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Michelbrink, Markus Interfaces as functors, programs as coalgebras – a final coalgebra theorem in intensional type theory. (English) Zbl 1099.03020 Theor. Comput. Sci. 360, No. 1-3, 415-439 (2006). MSC: 03B70 03G30 68N30 03F35 18D15 68Q65 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Abbott, Michael; Altenkirch, Thorsten; Ghani, Neil Containers: Constructing strictly positive types. (English) Zbl 1077.68015 Theor. Comput. Sci. 342, No. 1, 3-27 (2005). MSC: 68N18 × Cite Format Result Cite Review PDF Full Text: DOI
Bauer, Andrej; Birkedal, Lars; Scott, Dana S. Equilogical spaces. (English) Zbl 1059.18004 Theor. Comput. Sci. 315, No. 1, 35-59 (2004). Reviewer: Manuel Ojeda Aciego (Malaga) MSC: 18C50 68Q55 18D15 03G30 × Cite Format Result Cite Review PDF Full Text: DOI
Sambin, Giovanni Some points in formal topology. (English) Zbl 1044.54001 Theor. Comput. Sci. 305, No. 1-3, 347-408 (2003). Reviewer: Peter T. Johnstone (Cambridge) MSC: 54A05 03A05 03F65 × Cite Format Result Cite Review PDF Full Text: DOI
Curi, Giovanni Constructive metrisability in point-free topology. (English) Zbl 1045.54002 Theor. Comput. Sci. 305, No. 1-3, 85-109 (2003). Reviewer: Bohumil František Šmarda (Brno) MSC: 54A05 54E35 03F60 × Cite Format Result Cite Review PDF Full Text: DOI
Gordon, Andrew D.; Jeffrey, Alan Typing correspondence assertions for communication protocols. (English) Zbl 1023.68006 Theor. Comput. Sci. 300, No. 1-3, 379-409 (2003). MSC: 68M12 68P25 × Cite Format Result Cite Review PDF Full Text: DOI
Bidoit, Michel; Hennicker, Rolf; Kurz, Alexander Observational logic, constructor-based logic, and their duality. (English) Zbl 1038.68079 Theor. Comput. Sci. 298, No. 3, 471-510 (2003). MSC: 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI
Lucanu, Dorel Relaxed models for rewriting logic. (English) Zbl 1018.68036 Theor. Comput. Sci. 290, No. 1, 265-289 (2003). MSC: 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI
Valentini, Silvio A cartesian closed category in Martin-Löf’s intuitionistic type theory. (English) Zbl 1018.68078 Theor. Comput. Sci. 290, No. 1, 189-219 (2003). MSC: 68T27 03B15 03B20 × Cite Format Result Cite Review PDF Full Text: DOI
Hernando, Carmen; Houle, Michael E.; Hurtado, Ferran On local transformation of polygons with visibility properties. (English) Zbl 1061.68168 Theor. Comput. Sci. 289, No. 2, 919-937 (2002). MSC: 68U05 52B99 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Mossakowski, Till Relating CASL with other specification languages: the institution level. (English) Zbl 1061.68106 Theor. Comput. Sci. 286, No. 2, 367-475 (2002). MSC: 68Q65 68N30 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Astesiano, Egidio; Bidoit, Michel; Kirchner, Hélène; Krieg-Brückner, Bernd; Mosses, Peter D.; Sannella, Donald; Tarlecki, Andrzej CASL: the Common Algebraic Specification Language. (English) Zbl 1061.68103 Theor. Comput. Sci. 286, No. 2, 153-196 (2002). MSC: 68Q65 68N30 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Chiuyuan A necessary condition for a graph to be the visibility graph of a simple polygon. (English) Zbl 1002.68184 Theor. Comput. Sci. 276, No. 1-2, 417-424 (2002). MSC: 68U05 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Kurz, Alexander; Hennicker, Rolf On institutions for modular coalgebraic specifications. (English) Zbl 1052.68089 Theor. Comput. Sci. 280, No. 1-2, 69-103 (2002). MSC: 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI
Wolter, Uwe CSP, partial automata, and coalgebras. (English) Zbl 1050.68099 Theor. Comput. Sci. 280, No. 1-2, 3-34 (2002). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Uustalu, Tarmo; Vene, Varmo Least and greatest fixed points in intuitionistic natural deduction. (English) Zbl 0984.68136 Theor. Comput. Sci. 272, No. 1-2, 315-339 (2002). MSC: 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Barthe, G.; Hatcliff, J.; Sørensen, M. H. B. An induction principle for pure type systems. (English) Zbl 0992.68188 Theor. Comput. Sci. 266, No. 1-2, 773-818 (2001). MSC: 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Schürmann, C.; Despeyroux, J.; Pfenning, F. Primitive recursion for higher-order abstract syntax. (English) Zbl 0994.68028 Theor. Comput. Sci. 266, No. 1-2, 1-57 (2001). MSC: 68N18 × Cite Format Result Cite Review PDF Full Text: DOI
Lu, B.-K.; Hsu, F.-R.; Tang, C. Y. Finding the shortest boundary guard of a simple polygon. (English) Zbl 0973.68241 Theor. Comput. Sci. 263, No. 1-2, 113-121 (2001). MSC: 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Chiuyuan; Wu, K. Disproving a conjecture on planar visibility graphs. (English) Zbl 0974.68144 Theor. Comput. Sci. 255, No. 1-2, 659-665 (2001). MSC: 68R10 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Honsell, F.; Miculan, M.; Scagnetto, I. \(\pi\)-calculus in (Co)inductive-type theory. (English) Zbl 0956.68095 Theor. Comput. Sci. 253, No. 2, 239-285 (2001). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Galmiche, Didier; Pym, David J. Proof-search in type-theoretic languages: An introduction. (English) Zbl 0952.03006 Theor. Comput. Sci. 232, No. 1-2, 5-53 (2000). MSC: 03B35 03B15 03F03 68N18 03B70 × Cite Format Result Cite Review PDF Full Text: DOI
Caldwell, James L.; Gent, Ian P.; Underwood, Judith Search algorithms in type theory. (English) Zbl 0951.68147 Theor. Comput. Sci. 232, No. 1-2, 55-90 (2000). MSC: 68T15 03B15 03B35 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Troelstra, A. S. From constructivism to computer science. (English) Zbl 0913.68074 Theor. Comput. Sci. 211, No. 1-2, 233-252 (1999). MSC: 68Q05 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Dybjer, Peter Representing inductively defined sets by wellorderings in Martin-Löf’s type theory. (English) Zbl 0898.68047 Theor. Comput. Sci. 176, No. 1-2, 329-335 (1997). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Hennicker, Rolf; Wirsing, Martin; Bidoit, Michel Proof systems for structured specifications with observability operators. (English) Zbl 0901.68116 Theor. Comput. Sci. 173, No. 2, 393-443 (1997). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Bidoit, Michel; Hennicker, Rolf Behavioural theories and the proof of behavioural properties. (English) Zbl 0872.68167 Theor. Comput. Sci. 165, No. 1, 3-55 (1996). MSC: 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Prasad, L.; Iyengar, S. S. A note on the combinatorial structure of the visibility graph in simple polygons. (English) Zbl 0874.68285 Theor. Comput. Sci. 140, No. 2, 249-263 (1995). MSC: 68U05 68T20 93C85 × Cite Format Result Cite Review PDF Full Text: DOI
Kobayashi, Satoshi; Tatsuta, Makoto Realizability interpretation of generalized inductive definitions. (English) Zbl 0801.03022 Theor. Comput. Sci. 131, No. 1, 121-138 (1994). MSC: 03B70 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Takayama, Yukihide Defining concurrent processes constructively. (English) Zbl 0801.68056 Theor. Comput. Sci. 122, No. 1-2, 137-164 (1994). MSC: 68Q10 68Q60 03F55 × Cite Format Result Cite Review PDF Full Text: DOI
Meseguer, José Conditional rewriting logic as a unified model of concurrency. (English) Zbl 0758.68043 Theor. Comput. Sci. 96, No. 1, 73-155 (1992). Reviewer: M.Jantzen (Hamburg) MSC: 68Q55 03C65 03B80 × Cite Format Result Cite Review PDF Full Text: DOI
Jones, Neil D. Static semantics, types, and binding time analysis. (English) Zbl 0796.68050 Theor. Comput. Sci. 90, No. 1, 95-118 (1991). MSC: 68N15 68Q55 68N20 × Cite Format Result Cite Review PDF Full Text: DOI
Vissers, Chris A.; Scollo, Giuseppe; van Sinderen, Marten; Brinksma, Ed Specification styles in distributed systems design and verification. (English) Zbl 0772.68065 Theor. Comput. Sci. 89, No. 1, 179-206 (1991). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Manca, V.; Salibra, A.; Scollo, G. Equational type logic. (English) Zbl 0716.03022 Theor. Comput. Sci. 77, No. 1-2, 131-159 (1990). MSC: 03C05 68Q65 08B05 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI Link
Wells, Charles A generalization of the concept of sketch. (English) Zbl 0704.18001 Theor. Comput. Sci. 70, No. 1, 159-178 (1990). Reviewer: Vl.Topencharov MSC: 18C10 18A10 68Q55 68N15 × Cite Format Result Cite Review PDF Full Text: DOI