Filters








352,550 Hits in 4.4 sec

Constraint programming for type inference in flexible model-driven engineering

Athanasios Zolotas, Robert Clarisó, Nicholas Matragkas, Dimitrios S. Kolovos, Richard F. Paige
2017 Computer languages, systems & structures  
In this paper, we propose a novel approach that assists in the inference of the types of untyped model elements using Constraint Programming.  ...  The reduction in the effort needed to complete the missing types reaches up to 91.45% compared to the scenario where the language engineers had to identify and complete the types without guidance.  ...  Acknowledgements This work was carried out in cooperation with Digital Lightspeed Solutions Ltd, and was supported by the EPSRC through the LSCITS initiative and part supported by the EU, through the MONDO  ... 
doi:10.1016/j.cl.2016.12.002 fatcat:fipelntbffgfpf7pjehyrcfyjy

Tunable Static Inference for Generic Universe Types [chapter]

Werner Dietl, Michael D. Ernst, Peter Müller
2011 Lecture Notes in Computer Science  
This paper addresses this issue by presenting a tunable static type inference for Generic Universe Types. In contrast to classical type systems, ownership types have no single most general typing.  ...  Our inference is tunable: users can indicate a preference for certain typings by adjusting the heuristics or by supplying partial annotations for the program.  ...  Werner Dietl was supported in part by a fellowship from the Swiss National Science Foundation (SNSF). This work was also supported by NSF grant CNS-0855252.  ... 
doi:10.1007/978-3-642-22655-7_16 fatcat:2xz6hyilbzbinfe6lz7tgkkfzi

Research on Mechanism of Variable Event in CLP System

Jing Wan, Likang Tian, Junkai Yi, Yubin Zhou
2013 Research Journal of Applied Sciences Engineering and Technology  
Constraint inference engine as the core part of constraint logic programming system comprises variable set, temporary container and constraint filter and inference engine and adopts branching strategy,  ...  The experiments show that variable event setting can enhance the efficiency of constraint inference engine.  ...  In constraint logic programming, constraint inference engine is the core, whose efficiency improvement is important to enhance the search efficiency.  ... 
doi:10.19026/rjaset.5.4930 fatcat:mn4biuncunchnnnpjofmesxely

Complete and decidable type inference for GADTs

Tom Schrijvers, Simon Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis
2009 SIGPLAN notices  
Unfortunately, they pose a tough problem for type inference: we lose the principal-type property, which is necessary for modular type inference.  ...  We present a novel and simplified type inference approach for local type assumptions from GADT pattern matches.  ...  Type inference by constraint solving It is well known that type inference can be carried out in two stages: first generate constraints from the program text, and then solve the constraints ignoring the  ... 
doi:10.1145/1631687.1596599 fatcat:uc5noads4ralxjnnav3bbzavxi

Principal Type Inference for GHC-Style Multi-parameter Type Classes [chapter]

Martin Sulzmann, Tom Schrijvers, Peter J. Stuckey
2006 Lecture Notes in Computer Science  
Our results provide new insights on how to perform type inference for advanced type extensions.  ...  We observe that the combination of multi-parameter type classes with existential types and type annotations leads to a loss of principal types and undecidability of type inference.  ...  Completeness guarantees that if the program is well-typed type inference will infer a type for the program whereas principality guarantees that any type possibly given to the program can be derived from  ... 
doi:10.1007/11924661_2 fatcat:kkiu3t64zze6nosfo4ugwvepse

Inference of Well-Typings for Logic Programs with Application to Termination Analysis [chapter]

Maurice Bruynooghe, John Gallagher, Wouter Van Humbeeck
2005 Lecture Notes in Computer Science  
Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation.  ...  Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation.  ...  He also verified that the generated types were accepted by the Mercury type checker.  ... 
doi:10.1007/11547662_5 fatcat:fs6cdcdhgzgkhgtswybuebx52i

Soft typing with conditional types

Alexander Aiken, Edward L. Wimmers, T. K. Lakshman
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive  ...  Conditional types enable us to analyze control ow using type inference, thus facilitating computation of accurate types.  ...  Interest in inferring types for dynamically typed programs began with Reynolds 19] .  ... 
doi:10.1145/174675.177847 dblp:conf/popl/AikenWL94 fatcat:m2jeik33sbazdioy2tsznto2jy

Static Type Inference for the Q language using Constraint Logic Programming

Zsolt Zombori, János Csorba, Péter Szeredi, Marc Herbstritt
2012 International Conference on Logic Programming  
We map the task of type inference onto a constraint satisfaction problem and use constraint logic programming, in particular the Constraint Handling Rules extension of Prolog.  ...  We describe an application of Prolog: a type inference tool for the Q functional language.  ...  [5] report on using constraints in type checking and inference for Prolog.  ... 
doi:10.4230/lipics.iclp.2012.119 dblp:conf/iclp/ZomboriCS12 fatcat:hpwkeaesuje2zncyn4dr2wwixy

MaxSMT-Based Type Inference for Python 3 [chapter]

Mostafa Hassan, Caterina Urban, Marco Eilers, Peter Müller
2018 Lecture Notes in Computer Science  
We present Typpete, a sound type inferencer that automatically infers Python 3 type annotations.  ...  Typpete encodes type constraints as a MaxSMT problem and uses optional constraints and specific quantifier instantiation patterns to make the constraint solving process efficient.  ...  Typpete performs whole-program type inference, as there are no principal typings in object-oriented languages like Python [1, example in Sect. 1]; the inferred types are correct in the given context but  ... 
doi:10.1007/978-3-319-96142-2_2 fatcat:jjzfgxpx5rfcfbman2muiq2ufu

Data Type Inference for Logic Programming [article]

João Barbosa, Mário Florido, Vítor Santos Costa
2021 arXiv   pre-print
In this paper we present a new static data type inference algorithm for logic programming.  ...  The algorithm is also able to infer types given data type definitions similar to data definitions in Haskell and, in this case, the inferred types are more informative in general.  ...  Constraints and Constraint Generation 326 The type inference algorithm begins by generating type constraints from a logic 327 program, that will be solved by a constraint solver in a second stage of  ... 
arXiv:2108.06562v1 fatcat:e7f2fqamxnacvepkrvyfyqtvhq

Type Processing by Constraint Reasoning [chapter]

Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny
2006 Lecture Notes in Computer Science  
Herbrand constraint solving or unification has long been understood as an efficient mechanism for type checking and inference for programs using Hindley/Milner types.  ...  Strongly typed languages provide the user with the convenience to significantly reduce the number of errors in a program. Well-typed programs can be  ...  Failure of Type Inference A program is ill-typed if the constraints on its type are unsatisfiable.  ... 
doi:10.1007/11924661_1 fatcat:4elrruxqerhu7hcjke32y4joqe

Object-oriented type inference

Jens Palsberg, Michael I. Schwartzbach
1991 Conference proceedings on Object-oriented programming systems, languages, and applications - OOPSLA '91  
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding.  ...  Using a trace graph, our algorithm constructs a set of conditional type constraints and computes the least solution by least fixed-point derivation.  ...  The algorithm is similar to previous work on type inference [18, 14, 27, 1, 2, 19, 12, 10, 9] in using type constraints, but it differs in handling late binding by conditional constraints and in resolving  ... 
doi:10.1145/117954.117965 dblp:conf/oopsla/PalsbergS91 fatcat:bsswpfwyy5bezexb4kkxumvcji

Object-Oriented Type Inference

Jens Palsberg, Michael I. Schwartzbach
1991 DAIMI Report Series  
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding.  ...  Using a trace graph, our algorithm constructs a set of conditional type constraints and computes the least solution by least fixed-point derivation.  ...  The algorithm is similar to previous work on type inference [18, 14, 27, 1, 2, 19, 12, 10, 9] in using type constraints, but it differs in handling late binding by conditional constraints and in resolving  ... 
doi:10.7146/dpb.v20i345.6575 fatcat:5ujovb7y5jfurfpct4xji72itq

Object-oriented type inference

Jens Palsberg, Michael I. Schwartzbach
1991 SIGPLAN notices  
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding.  ...  Using a trace graph, our algorithm constructs a set of conditional type constraints and computes the least solution by least fixed-point derivation.  ...  The algorithm is similar to previous work on type inference [18, 14, 27, 1, 2, 19, 12, 10, 9] in using type constraints, but it differs in handling late binding by conditional constraints and in resolving  ... 
doi:10.1145/118014.117965 fatcat:gddib3nz4bgund5iwrfvnrmjby

Program analysis using mixed term and set constraints [chapter]

Manuel Fähndrich, Alexander Aiken
1997 Lecture Notes in Computer Science  
In constraint-based program analysis, at one extreme methods based on uni cation of equality constraints over terms are very fast but often imprecise.  ...  There is a tension in program analysis between precision and e ciency.  ...  The running time of our type inference with exceptions is roughly within a factor of three of standard type inference on medium-size programs.  ... 
doi:10.1007/bfb0032737 fatcat:kofma76kpfgvhabmgvebt42xli
« Previous Showing results 1 — 15 out of 352,550 results