[1] M. Sulzmann and P. J. Stuckey. Hm(x) type inference is clp(x) solving. J. Funct. Program., 18(2):251-283, 2008.
[ bib | ps.gz ]
[2] M. Sulzmann, E. S. L. Lam, and P. van Weert. Actors with multi-headed message receive patterns. In Proc. of Coordination'08, volume 5052 of LNCS, pages 315-330. Springer-Verlag, 2008.
[ bib | ps.gz ]
[3] M. Sulzmann and E. S. L. Lam. Parallel execution of multi set constraint rewrite rules, 2008. To appear.
[ bib | ps.gz ]
[4] M. Sulzmann and D. H. Chu. A rule-based specification of software transactional memory. Manuscript, May 2008.
[ bib | ps.gz ]
[5] E.S.L. Lamd and M. Sulzmann. Finally, a comparison between Constraint Handling Rules and Join-Calculus. Manuscript, May 2008.
[ bib | ps.gz ]
[6] T. Schrijvers and M. Sulzmann. Restoring confluence for functional dependencies. Accepted at TFP'08, April 2008.
[ bib | ps.gz ]
[7] B. Oliveira and M. Sulzmann. Objects to unify type classes and GADTs. Manuscript, April 2008.
[ bib | ps.gz ]
[8] T. Schrijvers, S. Peyton Jones, M. M. T. Chakravarty, and M. Sulzmann. Type checking with open type functions. Manuscript, April 2008.
[ bib | ps.gz ]
[9] M. Sulzmann and K.Z.M. Lu. Partial derivative regular expression pattern matching. Manuscript, December 2007.
[ bib | ps.gz ]
[10] M. Sulzmann and K.Z.M. Lu. XHaskell - adding regular expression types to Haskell. In Proc. of IFL'2007, 2007. To appear.
[ bib | ps.gz | Long version ]
[11] G. J. Duck, P. J. Stuckey, and M. Sulzmann. Observable confluence for constraint handling rules. In Proc. of ICLP'07, volume 4670 of LNCS, pages 224-239, 2007.
[ bib | ps.gz ]
[12] M. Sulzmann and E. S. L. Lam. Compiling constraint handling rules with lazy and concurrent search techniques. Technical report, 2007. Proc. of CHR 2007, Fourth Workshop on Constraint Handling Rules.
[ bib | ps.gz ]
[13] T. Schrijvers, M. Sulzmann, S. Peyton Jones, and M. M. T. Chakravarty. Towards open type functions for Haskell. Manuscript, September 2007.
[ bib | ps.gz ]
[14] M. Sulzmann and E. S. L. Lam. Haskell - Join - Rules. In Draft Proc. of IFL'07, September 2007.
[ bib | ps.gz ]
[15] M. Sulzmann and K.Z.M. Lu. A faithful semantics for Hindley/Milner with regular expression types. Manuscript, July 2007.
[ bib | ps.gz ]
[16] M. Sulzmann and M. Wang. GADTless programming in Haskell 98. Manuscript, June 2007.
[ bib | ps.gz ]
[17] M. Sulzmann and E. S. L. Lam. A concurrent constraint handling rules semantics and its implementation with software transactional memory. Manuscript, June 2007.
[ bib | ps.gz ]
[18] M. Sulzmann and K.Z.M. Lu. A coherent translation scheme for parametric regular types. Manuscript, April 2007.
[ bib | ps.gz ]
[19] M. Sulzmann and M. Wang. Aspect-oriented programming with type classes. In Proc. of Sixth International Workshop on Foundations of Aspect-Oriented Languages (FOAL 2007), pages 65-74. ACM Press, 2007.
[ bib | ps.gz ]
[20] M. Sulzmann, G. J. Duck, S. Peyton Jones, and P. J. Stuckey. Understanding functional dependencies via constraint handling rules. J. Funct. Program., 17(1):83-129, 2007.
[ bib | pdf ]
[21] M. Sulzmann, M. M. T. Chakravarty, S. Peyton Jones, and K. Donnelly. System F with type equality coercions. In Proc. of ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07), pages 53-66. ACM Press, 2007.
[ bib | ps.gz ]
[22] E. S. L. Lam and M. Sulzmann. A concurrent Constraint Handling Rules implementation in Haskell with software transactional memory. In Proc. of ACM SIGPLAN Workshop on Declarative Aspects of Multicore Programming (DAMP'07), pages 19-24, 2007.
[ bib | ps.gz ]
[23] M. Sulzmann, T. Schrijvers, and P. J. Stuckey. Principal type inference for GHC-style multi-parameter type classes. In Proc. of APLAS'06, volume 4279 of LNCS, pages 26-43. Springer-Verlag, 2006.
[ bib | ps.gz ]
[24] P. J. Stuckey, M. Sulzmann, and J. Wazny. Type processing by constraint reasoning. In Proc. of APLAS'06, volume 4279 of LNCS, pages 1-25. Springer-Verlag, 2006.
[ bib | pdf ]
[25] M. Sulzmann and K.Z.M. Lu. Type inference and compilation for parametric regular data types. Manuscript, October 2006.
[ bib | ps.gz ]
[26] M. Sulzmann and K. Z. M. Lu. The marriage of Haskell and XDuce. Manuscript, October 2006.
[ bib | ps.gz ]
[27] M. Sulzmann and M. Wang. Modular generic programming with extensible superclasses. In Proc. of ACM SIGPLAN 2006 Workshop on Generic Programming (WGP'06). ACM Press, 2006.
[ bib | ps.gz ]
[28] M. Sulzmann and E. S. L. Lam. Specifying and controlling agents in haskell. Manuscript, September 2006.
[ bib | ps.gz ]
[29] M. Sulzmann and R. Voicu. Language-based program verification via expressive types. In Workshop on Programming Languages meet Program Verification'06, pages 13-27, 2006.
[ bib | ps.gz | Talk ]
[30] M. Sulzmann, T. Schrijvers, and P. J. Stuckey. Type inference for GADTs via Herbrand constraint abduction. Manuscript, July 2006.
[ bib | ps.gz ]
[31] E. S. L. Lam and M. Sulzmann. Towards agent programming in CHR. Technical Report CW 452, Katholieke Universteit Leuven, 2006. Proc. of CHR 2006, Third Workshop on Constraint Handling Rules.
[ bib | ps.gz ]
[32] G. J. Duck, P. J. Stuckey, and M. Sulzmann. Observable confluence for constraint handling rules. Technical Report CW 452, Katholieke Universteit Leuven, 2006. Proc. of CHR 2006, Third Workshop on Constraint Handling Rules.
[ bib | ps.gz ]
[33] M. Sulzmann. Extracting programs from type class proofs. In Proc. of PPDP'06, pages 97-108. ACM Press, 2006.
[ bib | pdf | (c) ACM Press | Talk ]
[34] M. Sulzmann, J. Wazny, and P. J. Stuckey. A framework for extended algebraic data types. In Proc. of FLOPS'06, volume 3945 of LNCS, pages 47-64. Springer-Verlag, 2006.
[ bib | Long version | Talk ]
[35] M. Sulzmann, T. Schrijvers, and P. J. Stuckey. Type inference via constraint abduction for EADTs. Manuscript, April 2006.
[ bib | ps.gz ]
[36] P. J. Stuckey and M. Sulzmann. A theory of overloading. ACM Transactions on Programming Languages and Systems (TOPLAS), 27(6):1-54, 2005.
[ bib | ps.gz | (c) ACM Press ]
[37] M. Sulzmann and E. S. L. Lam. Associated functional dependencies. Manuscript, October 2005.
[ bib | ps.gz ]
[38] M. Sulzmann and M. Wang. Translating generalized algebraic data types to System F. Manuscript, October 2005.
[ bib | ps.gz ]
[39] M. Sulzmann and K. Z. M. Lu. Ad-hoc polymorphism for polymorphic XML transformations. Manuscript, October 2005.
[ bib | ps.gz ]
[40] M. Sulzmann and K. Z. M. Lu. A type-safe embedding of XDuce into ML (extended version). Manuscript, October 2005.
[ bib | ps.gz ]
[41] M. Sulzmann, J. Wazny, and P. J. Stuckey. Constraint abduction and constraint handling rules. Technical Report CW 421, Katholieke Universteit Leuven, 2005. Proc. of CHR 2005, Second Workshop on Constraint Handling Rules.
[ bib | ps.gz | Talk ]
[42] M. Sulzmann. Chameleon: Systematic type system design via constraint handling rules. CHR 2005 invited talk.
[ bib | Talk ]
[43] M. Sulzmann and K. Z. M. Lu. A type-safe embedding of XDuce into ML. In Proc. of ACM SIGPLAN Workshop on ML, volume 1024 of Electronic Notes in Computer Science, pages 229-253, 2005.
[ bib | ps.gz | Talk ]
[44] M. Sulzmann, J. Wazny, and P. J. Stuckey. Co-induction and type improvement in type class proofs. Manuscript, July 2005.
[ bib | ps.gz ]
[45] M. Sulzmann, J. Wazny, and P. J. Stuckey. A framework for extended algebraic data types. Manuscript, July 2005.
[ bib | pdf ]
[46] M. Sulzmann and J. Wazny. Lexically scoped type annotations. Manuscript, July 2005.
[ bib | ps.gz ]
[47] S. Kothari and M. Sulzmann. C++ templates/traits versus haskell type classes. Technical Report TRB2/05, The National University of Singapore, 2005.
[ bib | pdf ]
[48] P. J. Stuckey and M. Sulzmann. Solutions of implication constraints yield type inference for more general algebraic data types. Manuscript, April 2005.
[ bib | ps.gz ]
[49] P. J. Stuckey and M. Sulzmann. Type inference for guarded recursive data types. Manuscript, February 2005.
[ bib | ps.gz ]
[50] P. J. Stuckey, M. Sulzmann, and J. Wazny. Improved inference for checking type annotations. Technical Report TRA2/05, The National University of Singapore, 2005.
[ bib | ps.gz ]
[51] P. J. Stuckey and M. Sulzmann. A unifying inference framework for Hindley/Milner with extensions. Technical Report TR12/04, The National University of Singapore, 2004.
[ bib | ps.gz ]
[52] P. J. Stuckey, M. Sulzmann, and J. Wazny. Existentially quantified type classes. Manuscript, 2004.
[ bib | ps.gz ]
[53] M. Sulzmann and M. Wang. A systematic translation of guarded recursive data types to existential types. Technical Report TR22/04, The National University of Singapore, 2004.
[ bib | ps.gz ]
[54] K. Z. M. Lu and M. Sulzmann. An implementation of subtyping among regular expression types. In Proc. of APLAS'04, volume 3302 of LNCS, pages 57-73. Springer-Verlag, 2004.
[ bib | ps.gz | (c) Springer-Verlag | Talk ]
[55] P. J. Stuckey, M. Sulzmann, and J. Wazny. Improving type error diagnosis. In Proc. of Haskell Workshop'04, pages 80-91. ACM Press, 2004.
[ bib | ps.gz | (c) ACM Press ]
[56] G. J. Duck, S. Peyton Jones, P. J. Stuckey, and M. Sulzmann. Sound and decidable type inference for functional dependencies. In Proc. of ESOP'04, volume 2986 of LNCS, pages 49-63. Springer-Verlag, 2004.
[ bib | ps.gz | (c) Springer-Verlag | Long version | Talk ]
[57] K. Marriott, P. J. Stuckey, and M. Sulzmann. Resource usage verification. In Proc. of APLAS'03, volume 2895 of LNCS, pages 212-229. Springer-Verlag, 2003.
[ bib | ps.gz | (c) Springer-Verlag | Long version | Talk ]
[58] P. J. Stuckey, M. Sulzmann, and J. Wazny. The Chameleon type debugger. In Proc. of Fifth International Workshop on Automated Debugging (AADEBUG 2003), pages 247-258. Computer Research Repository (http://www.acm.org/corr/), 2003.
[ bib | pdf ]
[59] P. J. Stuckey, M. Sulzmann, and J. Wazny. Interactive type debugging in Haskell. In Proc. of Haskell Workshop'03, pages 72-83. ACM Press, 2003.
[ bib | ps.gz | (c) ACM Press ]
[60] K. Glynn, P. J. Stuckey, M. Sulzmann, and H. Søndergaard. Exception analysis for non-strict languages. In Proc. of ICFP'02, pages 98-109. ACM Press, 2002.
[ bib | ps.gz | (c) ACM Press ]
[61] P. J. Stuckey and M. Sulzmann. A theory of overloading. In Proc. of ICFP'02, pages 167-178. ACM Press, 2002.
[ bib | ps.gz | (c) ACM Press ]
[62] P. J. Stuckey and M. Sulzmann. A systematic approach in type system design based on constraint handling rules. Third Workshop on Rule-Based Constraint Reasoning and Programming, 2001.
[ bib | ps.gz ]
[63] K. Glynn, P.J. Stuckey, and M. Sulzmann. Effective strictness analysis with horn constraints. In Proc. of SAS'01, volume 2126 of LNCS, pages 73-92. Springer-Verlag, 2001.
[ bib | ps.gz | (c) Springer-Verlag ]
[64] K. Glynn, P. J. Stuckey, M. Sulzmann, and H. Søndergaard. Boolean constraints for binding-time analysis. In Proc. of PADO'01, volume 2053 of LNCS, pages 39-63. Springer, 2001.
[ bib | ps.gz | (c) Springer-Verlag ]
[65] M. Sulzmann. A general type inference framework for hindley/milner style systems. In Proc. of FLOPS'01, volume 2024 of LNCS, pages 246-263. Springer-Verlag, 2001.
[ bib | ps.gz | (c) Springer-Verlag ]
[66] K. Glynn, P.J. Stuckey, and M. Sulzmann. The hm(chr) framework. Technical report, Department of Computer Science, The University of Melbourne, 2001. Superseded by [61].
[ bib | ps.gz ]
[67] K. Glynn, P.J. Stuckey, and M. Sulzmann. A general type class framework. Technical report, Department of Computer Science, The University of Melbourne, 2001. Superseded by [36].
[ bib | ps.gz ]
[68] K. Glynn, P. J. Stuckey, and M. Sulzmann. Type classes and constraint handling rules. In Proc. of First Workshop on Rule-Based Constraint Reasoning and Programming. Computer Research Repository (http://www.acm.org/corr/), 2000.
[ bib | ps.gz ]
[69] M. Sulzmann. A General Framework for Hindley/Milner Type Systems with Constraints. PhD thesis, Yale University, Department of Computer Science, May 2000.
[ bib | ps.gz ]
[70] M. Sulzmann, M. Müller, and C. Zenger. Hindley/milner style type systems in constraint form. Research Report ACRC-99-009, University of South Australia, School of Computer and Information Science, 1999.
[ bib | ps.gz ]
[71] M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
[ bib | ps.gz ]
[72] M. Sulzmann. Designing Record Systems. Research Report YALEU/DCS/RR-1128, Yale University, Department of Computer Science, April 1997.
[ bib | ps.gz ]
[73] M. Sulzmann, M. Odersky, and M. Wehr. Type inference with constrained types. In FOOL4: 4th. Int. Workshop on Foundations of Object-oriented programming Languages, 1997.
[ bib | ps.gz ]
[74] B. Beckert, R. Hähnle, P. Oel, and M. Sulzmann. The tableau-based theorem prover 3tap, version 4.0. In Proc. of CADE'96, volume 1104 of LNCS, pages 303-307. Springer-Verlag, 1996.
[ bib ]

This file has been generated by bibtex2html 1.75