Combining Static and Dynamic Contract Checking for Curry

[1]  Michael Hanus,et al.  Verifying Fail-Free Declarative Programs , 2018, PPDP.

[2]  Michael Hanus,et al.  Proving Non-Deterministic Computations in Agda , 2017, WLP / WFLP.

[3]  Manuel V. Hermenegildo,et al.  Reducing the overhead of assertion run-time checks via static analysis , 2016, PPDP.

[4]  Michael Hanus,et al.  CurryCheck: Checking Properties of Curry Programs , 2016, LOPSTR.

[5]  Aaron Stump.  Verified Functional Programming in Agda , 2016 .

[6]  Michael Hanus,et al.  Default rules for Curry* , 2016, Theory and Practice of Logic Programming.

[7]  Koen Claessen,et al.  TIP: Tons of Inductive Problems , 2015, CICM.

[8]  Ranjit Jhala,et al.  LiquidHaskell: experience with refinement types in the real world , 2014, Haskell.

[9]  Michael Hanus,et al.  A modular and generic analysis server system for functional logic programs , 2014, PEPM '14.

[10]  Ranjit Jhala,et al.  Refinement types for Haskell , 2014, ICFP.

[11]  Sam Tobin-Hochstadt,et al.  Soft contract verification , 2014, ICFP.

[12]  Michael Hanus,et al.  Functional Logic Programming: From Theory to Curry , 2013, Programming Logics.

[13]  Manuel V. Hermenegildo,et al.  Sized Type Analysis for Logic Programs , 2013, Theory Pract. Log. Program..

[14]  Michael Hanus,et al.  Contracts and Specifications for Functional Logic Programming , 2012, PADL.

[15]  Michael Hanus.  Improving Lazy Non-Deterministic Computations by Demand Analysis , 2012, ICLP.

[16]  Michael Hanus,et al.  KiCS2: A New Compiler from Curry to Haskell , 2011, WFLP.

[17]  Bernd Brassel,et al.  Implementing Functional Logic Programs by Translation into Purely Functional Programs , 2012 .

[18]  Manuel Fähndrich,et al.  Static Contract Checking with Abstract Interpretation , 2010, FoVeOOS.

[19]  V. S. Costa,et al.  Theory and Practice of Logic Programming , 2010 .

[20]  Clark W. Barrett,et al.  The SMT-LIB Standard Version 2.0 , 2010 .

[21]  Matthias Felleisen,et al.  Future contracts , 2009, PPDP '09.

[22]  Michael Hanus,et al.  Set functions for functional logic programming , 2009, PPDP '09.

[23]  Na Xu.  Static contract checking for Haskell , 2009, POPL '09.

[24]  Peter Thiemann,et al.  True lies: Lazy contracts for lazy languages – Faithfulness is better than laziness , 2009 .

[25]  Sebastian Fischer,et al.  From Functional Logic Programs to Purely Functional Programs Preserving Laziness , 2008, IFL.

[26]  Sebastian Fischer,et al.  EasyCheck - Test Data for Free , 2008, FLOPS.

[27]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[28]  Francisco Javier López-Fraguas,et al.  Extra Variables Can Be Eliminated from Functional Logic Programs , 2007, Electron. Notes Theor. Comput. Sci..

[29]  Michael Hanus,et al.  Overlapping Rules and Logic Variables in Functional Logic Programs , 2006, ICLP.

[30]  Michael Hanus,et al.  Declarative Programming with Function Patterns , 2005, LOPSTR.

[31]  Colin Runciman,et al.  Lazy Assertions , 2003, IFL.

[32]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[33]  Michael Hanus,et al.  Curry: an integrated functional logic language (version 0 , 2003 .

[34]  Germán Vidal,et al.  An Operational Semantics for Declarative Multi-Paradigm Languages , 2002, WRS.

[35]  Sergio Antoy.  Constructor-based conditional narrowing , 2001, PPDP '01.

[36]  Ramin Sadre,et al.  Pakcs: The portland aachen kiel curry system , 2000 .

[37]  Francisco Javier López-Fraguas,et al.  An Approach to Declarative Programming Based on a Rewriting Logic , 1999, J. Log. Program..

[38]  Philip Wadler,et al.  How to declare an imperative , 1997, CSUR.

[39]  Rachid Echahed,et al.  A needed narrowing strategy , 2000, JACM.

[40]  John Launchbury,et al.  A natural semantics for lazy evaluation , 1993, POPL '93.

[41]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[42]  J. C. Gonz Alez-Moreno,et al.  An Approach to Declarative Programming Based on a Rewriting Logic , 2022 .