1. Working paper › Research
  2. Published

    Closure Properties of Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1996.

    Research output: Working paper

  3. Published

    Constraints and Universal Algebra

    Jeavons, P. G., Cohen, D. A. & Pearson, J. K., 1998.

    Research output: Working paper

  4. Published

    Constraints, Consistency and Closure

    Jeavons, P. G., Cohen, D. A. & Cooper, M. C., 1997.

    Research output: Working paper

  5. Published
  6. Published

    Supermodular Functions and the Complexity of MAX CSP

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 1 Jan 2004.

    Research output: Working paper

  7. Published

    The expressive power of valued constraints: hierarchies and collapses

    Cohen, D. A., Jeavons, P. G. & Zivný, S., 1 Apr 2007.

    Research output: Working paper

  8. Published

    Towards High Order Constraint Representations for the Frequency Assignment Problem

    Dunkin, N. W., Bater, J. E., Jeavons, P. G. & Cohen, D. A., 1998.

    Research output: Working paper

  9. Other contribution › Research
  10. Unpublished

    Complexity, Proofs and Algebra

    Tzameret, I., 2018, (Unpublished)

    Research output: Other contribution

  11. Published
  12. Published

    Lego and related work (summer school lecture notes)

    Luo, Z., 1999

    Research output: Other contribution

  13. Doctoral Thesis › Research
  14. Unpublished

    Above And Below Guarantee Parameterizations For Combinatorial Optimisation Problems

    Jones, M., 2013, (Unpublished) 141 p.

    Research output: ThesisDoctoral Thesis

  15. Unpublished

    An Extended Calculus of Constructions

    Luo, Z., 1990, (Unpublished) Univ of Edinburgh.

    Research output: ThesisDoctoral Thesis

  16. Unpublished

    Game-Based Development of Interactive Systems

    Stathis, K., 1 Nov 1996, (Unpublished)

    Research output: ThesisDoctoral Thesis

  17. Forthcoming

    On Key Assignment Schemes and Cryptographic Enforcement Mechanisms for Information Flow Policies

    Farley, N., 12 Nov 2018, (Accepted/In press) 187 p.

    Research output: ThesisDoctoral Thesis

  18. Published

    Studies in Algebraic and Propositional Proof Complexity

    Tzameret, I., 2008, Tel Aviv. 214 p.

    Research output: ThesisDoctoral Thesis

  19. Book › Research
  20. Published

    Computation and Reasoning: A Type Theory for Computer Science

    Luo, Z., 1994, Oxford Univ Press. 228 p.

    Research output: Book/ReportBook

  21. Published

    Digraphs: Theory, Algorithms and Applications

    Bang-Jensen, J. & Gutin, G., 2000, London: Springer-Verlag.

    Research output: Book/ReportBook

  22. Published

    Digraphs: Theory, Algorithms and Applications

    Bang-Jensen, J. & Gutin, G., 2010, 2nd ed. London: Springer-Verlag.

    Research output: Book/ReportBook

  23. Published

    LATEX Concisely

    Johnstone, A., 1 Sep 1992, Ellis Horwood. 170 p.

    Research output: Book/ReportBook

  24. Published

    Proc of TYPES Working Group Workshop on Subtyping, Inheritance, and Modularisation of Proofs

    Luo, Z. (ed.) & Soloviev, S. (ed.), 1997, Durham University.

    Research output: Book/ReportBook

  25. Published

    The Foundations of Programming Methodology (程序方法学基础)

    Chen, H., Luo, Z. & Ma, Q., 1987, Hunan Press of Sciences.

    Research output: Book/ReportBook

  26. Published

    Types for Proofs and Programs. Proc. of Inter. Conf. TYPES'2000, Durham, UK. LNCS 2277

    Callaghan, P. (ed.), Luo, Z. (ed.), McKinna, J. (ed.) & Pollack, R. (ed.), 2002, Springer.

    Research output: Book/ReportBook

  27. Scholarly edition › Research
  28. Published

    Logic Programs, Norms and Action - Essays in Honor of Marek J. Sergot on the Occasion of His 60th Birthday

    Artikis, A. (ed.), Craven, R. (ed.), Cicekli, N. K. (ed.), Sadighi, B. (ed.) & Stathis, K. (ed.), 2012, SPRINGER-VERLAG BERLIN.

    Research output: Book/ReportScholarly edition

  29. Other report › Research
  30. Unpublished

    Håstad‘s Separation of Constant-Depth Circuits Using Sipser Functions

    Tzameret, I., 2015, (Unpublished) Expository Note. 15 p.

    Research output: Book/ReportOther report

  31. Article › Research › Not peer-reviewed
  32. Published

    A classification of locally semicomplete digraphs

    Bang-Jensen, J., Guo, Y., Gutin, G. & Volkmann, L., 1997, In: Discrete Mathematics. 167/168, p. 101-114

    Research output: Contribution to journalArticle

  33. Published

    A note on cardinality of certain classes of unlabeled multipartite tournaments

    Gutin, G., 1998, In: Discrete Mathematics. 186, p. 277-280

    Research output: Contribution to journalArticle

  34. Published

    A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

    Gutin, G., Bang-Jensen, J. & Huang, J., 1996, In: Discrete Mathematics. 161, p. 1-12

    Research output: Contribution to journalArticle

  35. Published

    Algorithms with large domination ratio

    Alon, N., Gutin, G. & Krivelevich, M., 2004, In: Journal of Algorithms. 50, 1, p. 118-131

    Research output: Contribution to journalArticle

  36. Published

    Alternating cycles and trails in 2-edge-coloured multigraphs

    Bang-Jensen, J. & Gutin, G., 1998, In: Discrete Mathematics. 188, 1, p. 61-72

    Research output: Contribution to journalArticle

  37. Published

    Characterizations of vertex pancyclic and pancyclic ordinary semicomplete multipartite digraphs

    Gutin, G., 1995, In: Discrete Mathematics. 141, p. 153-162

    Research output: Contribution to journalArticle

  38. Published

    Evaluation of the contract-or-patch heuristic for the Asymmetric TSP

    Gutin, G. & Zverovitch, A., 2005, In: INFOR: Information Systems and Operational Research. 43, 1, p. 23-31

    Research output: Contribution to journalArticle

  39. Published

    Finding a longest path in a complete multipartite digraph

    Gutin, G., 1993, In: SIAM Journal on Discrete Mathematics. 6, 2, p. 270-273

    Research output: Contribution to journalArticle

  40. Published

    Generalizations of tournaments: A survey

    Bang-Jensen, J. & Gutin, G., 1998, In: Journal of Graph Theory. 28, 4, p. 171-202

    Research output: Contribution to journalArticle

  41. Published

    Maximizing traveling salesman problem for special matrices

    Blokh, D. & Gutin, G., 1995, In: Discrete Applied Mathematics. 56, 1, p. 83-86

    Research output: Contribution to journalArticle

  42. Published

    Minimizing and maximizing the diameter in orientations of graphs

    Gutin, G., 1994, In: Graphs and Combinatorics. 10, p. 225-230

    Research output: Contribution to journalArticle

  43. Published

    Paths and cycles in extended and decomposable digraphs

    Bang-Jensen, J. & Gutin, G., 1997, In: Discrete Mathematics. 164, p. 5-19

    Research output: Contribution to journalArticle

  44. Published

    Properly colored Hamilton cycles in edge colored complete graphs

    Gutin, G. & Alon, N., 1997, In: Random Structures and Algorithms. 11, 2, p. 179-186

    Research output: Contribution to journalArticle

  45. Published

    Relationships, Paths and Principal Matching: A New Approach to Access Control

    Crampton, J. & Sellwood, J., 29 May 2015, In: ArXiv.org.

    Research output: Contribution to journalArticle

  46. Published

    Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs

    Gutin, G. & Yeo, A., 2001, In: Graphs and Combinatorics. 17, 3, p. 473-477

    Research output: Contribution to journalArticle

  47. Published

    Sufficient conditions for a digraph to be Hamiltonian

    Gutin, G., Bang-Jensen, J. & Li, H., 1996, In: Journal of Graph Theory. 22, 2, p. 181-187

    Research output: Contribution to journalArticle

  48. Published

    Vertex heaviest paths and cycles in quasi-transitive digraphs.

    Gutin, G. & Bang-Jensen, J., 1996, In: Discrete Mathematics. 163, 1-3, p. 217-223

    Research output: Contribution to journalArticle

  49. Article › Research › Peer-reviewed
  50. Published

    (Non-)existence of Polynomial Kernels for the Test Cover Problem

    Gutin, G., Muciaccia, G. & Yeo, A., 2013, In: Information Processing Letters. 113, p. 123-126

    Research output: Contribution to journalArticlepeer-review

  51. Published

    A characterization of horizontal visibility graphs and combinatorics on words

    Gutin, G., Mansour, T. & Severini, S., 2011, In: Physica A: Statistical Mechanics and its Applications . 390, p. 2421-2428

    Research output: Contribution to journalArticlepeer-review

  52. Published

    A construction which can be used to produce finitely presented infinite simple groups

    Scott, E., 1984, In: Journal of Algebra. 90, p. 294-322

    Research output: Contribution to journalArticlepeer-review

  53. Published

    A Dichotomy for Minimum Cost Graph Homomorphisms

    Gutin, G., Hell, P., Rafiey, A. & Yeo, A., May 2008, In: European Journal of Combinatorics. 29, 4, p. 900-911 12 p.

    Research output: Contribution to journalArticlepeer-review

  54. Published

    A finitely presented simple group with unsolvable conjugacy problem

    Scott, E., 1984, In: Journal of Algebra. 90, p. 333-353

    Research output: Contribution to journalArticlepeer-review

  55. Published

    A formal model of agent-oriented virtual organisations and their formation

    McGinnis, J., Stathis, K. & Toni, F., 29 Dec 2011, In: Multiagent and Grid Systems. 7, 6, p. 291-310

    Research output: Contribution to journalArticlepeer-review

  56. Published

    A Game-based Architecture for developing Interactive Components in Computational Logic

    Stathis, K., Brogi, A. (ed.) & Hill, P. (ed.), 1 Mar 2000, In: Functional and Logic Programming, Special Issue on Logical Formalisms for Program Composition. 2000, 5

    Research output: Contribution to journalArticlepeer-review

  57. Published

    A Higher-order Calculus and Theory Abstraction

    Luo, Z., 1991, In: Information and Computation. 90, 1, p. 107-137 31 p.

    Research output: Contribution to journalArticlepeer-review

  58. Published

    A maximal tractable class of soft constraints

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2004, In: Journal of Artificial Intelligence Research. 22, p. 1-22

    Research output: Contribution to journalArticlepeer-review

  59. Forthcoming

    A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem

    Karapetyan, D. & Gutin, G., 2011, (Accepted/In press) In: Evolutionary Computation. in press

    Research output: Contribution to journalArticlepeer-review

  60. Forthcoming

    A new bound for 3-satisfiable MaxSat and its algorithmic application

    Gutin, G., Jones, M., Scheder, D. & Yeo, A., 2013, (Accepted/In press) In: Information and Computation. 8 p.

    Research output: Contribution to journalArticlepeer-review

  61. Published

    A new bound on the domination number of graphs with minimum degree two

    Henning, M., Schiermeyer, I. & Yeo, A., 2011, In: The Electronic Journal of Combinatorics. 18, 1

    Research output: Contribution to journalArticlepeer-review

  62. Published

    A New Sufficient Condition for a Digraph to be Hamiltonian

    Bang-Jensen, J., Guo, Y. & Yeo, A., 1999, In: Discrete Applied Mathematics. 95, 1-3, p. 61-72 12 p.

    Research output: Contribution to journalArticlepeer-review

  63. Published

    A new upper bound on the total domination number of a graph

    Henning, M. & Yeo, A., 2007, In: The Electronic Journal of Combinatorics. 14, 1

    Research output: Contribution to journalArticlepeer-review

  64. Published

    A Note on Alternating Cycles in Edge-coloured Graphs

    Yeo, A., 1997, In: Journal of Combinatorial Theory, Series B. 69, p. 222-225 4 p.

    Research output: Contribution to journalArticlepeer-review

  65. Published

    A Pluralist Approach to the Formalisation of Mathematics

    Adams, R. & Luo, Z., 2 Jul 2011, In: Mathematical Structures in Computer Science. 21, 4, p. 913-942 29 p.

    Research output: Contribution to journalArticlepeer-review

  66. Published

    A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph

    Yeo, A., 1999, In: Journal of Algorithms. 33, 1, p. 124-139 16 p.

    Research output: Contribution to journalArticlepeer-review

  67. Published

    A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

    Bang-Jensen, J., Gutin, G. & Yeo, A., 1998, In: Journal of Graph Theory. 29, 2, p. 111-132

    Research output: Contribution to journalArticlepeer-review

  68. Published

    A probabilistic approach to problems parameterized above or below tight bounds

    Gutin, G., Kim, E. J., Szeider, S. & Yeo, A., Mar 2011, In: Journal of Computer and System Sciences. 77, 2, p. 422-429

    Research output: Contribution to journalArticlepeer-review

  69. Published

    A problem of finding an acceptable variant in some generalized project networks

    Blokh, D., Gutin, G., Yeo, A. & Yeo, A., 2005, In: Journal of Applied Mathematics and Decision Science. 2, p. 75-81 7 p.

    Research output: Contribution to journalArticlepeer-review

  70. Published

    A Self-Healing Distributed Pervasive Health System

    Bromuri, S., Schumacher, M. & Stathis, K., 2013, In: Int. J. of Web Engineering and Technology. 8, 2, p. 177 196 p.

    Research output: Contribution to journalArticlepeer-review

  71. Published

    A transition from total domination in graphs to transversals in hypergraphs

    Henning, M. & Yeo, A., 2007, In: Quaestiones Mathematicae. 30, p. 1-20 20 p.

    Research output: Contribution to journalArticlepeer-review

  72. Published

    A unified theory of structural tractability for constraint satisfaction problems

    Cohen, D., Jeavons, P. & Gyssens, M., Aug 2008, In: Journal of Computer and System Sciences. 74, 5, p. 721-743 23 p.

    Research output: Contribution to journalArticlepeer-review

  73. Published

    Acyclicity in edge-colored graphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 6 Feb 2017, In: Discrete Mathematics. 340, 2, p. 1-8 8 p.

    Research output: Contribution to journalArticlepeer-review

  74. Published

    Adversarial resilience of matchings in bipartite random graphs

    Balister, P., Gerke, S. & McDowell, A., 2 Dec 2016, In: Journal of Combinatorics. 8, 1, p. 79-92 14 p.

    Research output: Contribution to journalArticlepeer-review

  75. Published

    Algebraic Proofs over Noncommutative Formulas

    Tzameret, I., 2011, In: Information and Computation. 209, 10, p. 1269-1292 24 p.

    Research output: Contribution to journalArticlepeer-review

  76. Published

    Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem.

    Cohen, N., Fomin, F., Gutin, G., Kim, E. J., Saurabh, S. & Yeo, A., 2010, In: Journal of Computer and System Sciences. 76, p. 650-662

    Research output: Contribution to journalArticlepeer-review

  77. Published

    Algorithms for generating convex sets in acyclic digraphs

    Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A. & Yeo, A., Dec 2009, In: Journal of Discrete Algorithms. 7, 4, p. 509–518 10 p.

    Research output: Contribution to journalArticlepeer-review

  78. Published

    Algorithms for Workflow Satisfiability Problem with User-independent Constraints

    Gutin, G. & Karapetyan, D., Mar 2020, In: International Journal of Graph Computing. 1, 1, p. 25-38 14 p.

    Research output: Contribution to journalArticlepeer-review

  79. Forthcoming

    All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Vertices

    Gutin, G., van Iersel, L., Mnich, M. & Yeo, A., 2011, (Accepted/In press) In: Journal of Computer and System Sciences. in press

    Research output: Contribution to journalArticlepeer-review

  80. Published

    Almost all almost regular c-partite tournaments with $c geq 5$ are vertex pancyclic

    Tewes, M., Volkmann, L. & Yeo, A., 2002, In: Discrete Mathematics. 242, 1-3, p. 201-228 28 p.

    Research output: Contribution to journalArticlepeer-review

  81. Published

    Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs

    Gutin, G., Koh, K. M., Tay, E. G. & Yeo, A., 2002, In: Graphs and Combinatorics. 18, 3, p. 499-506 8 p.

    Research output: Contribution to journalArticlepeer-review

  82. E-pub ahead of print

    Alternative parameterizations of Metric Dimension

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 25 Jan 2019, In: Theoretical Computer Science. p. 1-11 11 p.

    Research output: Contribution to journalArticlepeer-review

  83. Published

    An abstract framework for globalising interactive systems

    Stathis, K. & Sergot, M., Feb 1998, In: Interacting with Computers. 9, 4, p. 401-416 16 p.

    Research output: Contribution to journalArticlepeer-review

  84. Published

    An agile approach to language modelling and development

    Johnstone, A., Mosses, P. D. & Scott, E., Mar 2010, In: Innovations in Systems and Software Engineering. 6, 1-2, p. 145-153 9 p.

    Research output: Contribution to journalArticlepeer-review

  85. Published

    An Algebraic Theory of Complexity for Discrete Optimisation

    Cohen, D. A., Cooper, M. C., Creed, P., Jeavons, P. G. & Živný, S., 2013, In: SIAM Journal on Computing. 42, 5, p. 1915-1939 24 p.

    Research output: Contribution to journalArticlepeer-review

  86. Published

    An algorithm for finding input-output constrained convex sets in an acyclic digraph

    Gutin, G., Johnstone, A., Reddington, J., Scott, E. & Yeo, A., May 2012, In: Journal of Discrete Algorithms. 13, p. 47-58 12 p.

    Research output: Contribution to journalArticlepeer-review

  87. Published

    An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

    Gutin, G., Johnstone, A., Reddington, J., Scott, E., Yeo, A., Broersma, H. (ed.), Erlebach, T. (ed.), Friedeizky, T. (ed.) & Paulusma, D. (ed.), 2008, In: Lecture Notes in Computer Science. 5344, p. 206-217 12 p.

    Research output: Contribution to journalArticlepeer-review

  88. Published

    An Implementation of LF with Coercive Subtyping and Universes.

    Callaghan, P. & Luo, Z., 2001, In: Journal of Automated Reasoning. 27, 1, p. 3-27 25 p.

    Research output: Contribution to journalArticlepeer-review

  89. Published

    Anti-matroids

    Gutin, G. & Yeo, A., 2002, In: Operations Research Letters. 30, 2, p. 97-99

    Research output: Contribution to journalArticlepeer-review

  90. Published

    Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

    Gutin, G. & Sun, Y., May 2020, In: Discrete Mathematics. 343, 5, p. 1-4 4 p., 111816.

    Research output: Contribution to journalArticlepeer-review

  91. Published

    Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

    Sun, Y., Gutin, G. & Ai, J., Aug 2019, In: Discrete Mathematics. 342, 8, p. 2297-2305 9 p.

    Research output: Contribution to journalArticlepeer-review

  92. E-pub ahead of print

    Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

    Bang-Jensen, J., Gutin, G. & Yeo, A., 13 Apr 2020, In: Journal of Graph Theory.

    Research output: Contribution to journalArticlepeer-review

  93. Published

    Authorized workflow schemas: deciding realizability through $\mathsf{LTL }(\mathsf{F })$ model checking

    Crampton, J., Huth, M. & Huan-Pu Kuo, J., 2014, In: International Journal on Software Tools for Technology Transfer. 16, 1, p. 31-48

    Research output: Contribution to journalArticlepeer-review

  94. Published

    Automatic recursion engineering of reduction incorporated parsers

    Johnstone, A. & Scott, E., 1 Sep 2007, In: Science of Computer Programming. 68, 2, p. 95-110 16 p.

    Research output: Contribution to journalArticlepeer-review

  95. Published

    Automating Workflows using Dialetical Argumentation

    Urovi, V., Bromuri, S., Mcginnis, J., Stathis, K. & Omicini, A., 2008, In: International Journal on Computer Science and Information Systems. 3, 2, p. 110-125 16 p.

    Research output: Contribution to journalArticlepeer-review

  96. Published

    Batched bin packing

    Gutin, G., Jensen, T. & Yeo, A., 2005, In: Discrete Optimization. 2, 1, p. 71-82

    Research output: Contribution to journalArticlepeer-review

  97. Published

    Betweenness parameterized above tight lower bound

    Gutin, G., Kim, E. J., Mnich, M. & Yeo, A., Dec 2010, In: Journal of Computer and System Sciences. 76, 8, p. 872-878

    Research output: Contribution to journalArticlepeer-review

  98. E-pub ahead of print

    Binarisation for Valued Constraint Satisfaction Problems

    Cohen, D., Cooper, M., Jeavons, P., Krokhin, A., Powell, R. & Zivny, S., 3 Oct 2017, In: SIAM Journal on Discrete Mathematics. 31, 4, p. 2279-2300 22 p.

    Research output: Contribution to journalArticlepeer-review

  99. Published

    Binary constraint satisfaction problems defined by excluded topological minors

    Cohen, D., Cooper, M. C., Jeavons, P. G. & Zivny, S., Feb 2019, In: Infor. and Computation. 264, p. 12-31 20 p.

    Research output: Contribution to journalArticlepeer-review

  100. Published

    BRNGLR: a cubic Tomita-style GLR parsing algorithm

    Scott, E., Johnstone, A. & Economopoulos, R., Oct 2007, In: Acta Informatica. 44, 6, p. 427-461 35 p.

    Research output: Contribution to journalArticlepeer-review

  101. Published

    Building tractable disjunctive constraints

    Cohen, D. A., Jeavons, P. G., Jonsson, P. & Koubarakis, M., 2000, In: Journal of the ACM. 47, p. 826-853 28 p.

    Research output: Contribution to journalArticlepeer-review

  102. Published

    Characterising Tractable Constraints

    Cooper, M. C., Cohen, D. A. & Jeavons, P. G., 1994, In: Artificial Intelligence. 65, 2, p. 347-361 15 p.

    Research output: Contribution to journalArticlepeer-review

  103. E-pub ahead of print

    Characterizing Propositional Proofs as Non-commutative Formulas

    Li, F., Tzameret, I. & Wang, Z., 19 Jul 2018, In: SIAM Journal on Computing. 47, 4, p. 1424-1462 39 p.

    Research output: Contribution to journalArticlepeer-review

  104. Published

    Chinese Postman Problem on edge-colored multigraphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 30 Jan 2017, In: Discrete Applied Mathematics. 217, Part 2, p. 196-202 7 p.

    Research output: Contribution to journalArticlepeer-review

  105. Published

    Classical Predicative Logic-Enriched Type Theories

    Adams, R. & Luo, Z., Aug 2010, In: Annals of Pure and Applied Logic. 161, 11, p. 1315-1345 31 p.

    Research output: Contribution to journalArticlepeer-review

  106. Forthcoming

    Clique cover and graph separation: New incompressibility results

    Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M. & Wahlström, M., 2014, (Accepted/In press) In: ACM Transactions on Computation Theory (TOCT). 6, 2

    Research output: Contribution to journalArticlepeer-review

  107. Published

    Closure Properties of Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1997, In: Journal of the ACM. 44, p. 527-548 22 p.

    Research output: Contribution to journalArticlepeer-review

  108. Published

    Coercion completion and conservativity in coercive subtyping

    Soloviev, S. & Luo, Z., 2002, In: Annals of Pure and Applied Logic. 113, 1-3, p. 297-322 26 p.

    Research output: Contribution to journalArticlepeer-review

Previous 1 2 3 4 5 6 Next