Type Declaration

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 6897 Experts worldwide ranked by ideXlab platform

Steve Battle - One of the best experts on this subject based on the ideXlab platform.

Frank Steiner - One of the best experts on this subject based on the ideXlab platform.

  • curry an integrated functional logic language
    2003
    Co-Authors: Michael Hanus, Sergio Antoy, Herbert Kuchen, Francisco Javier Lopezfraguas, Wolfgang Lux, Juan Jose Moreno Navarro, Frank Steiner
    Abstract:

    ion: A[x/τ ] ` e :: τ ′ A ` \x->e :: τ → τ ′ if τ is a Type expression Existential: A[x/τ ] ` e :: Success A ` let x free in e :: Success if τ is a Type expression Conditional: A ` e1 :: Bool A ` e2 :: τ A ` e3 :: τ A ` if e1 then e2 else e3 :: τ Figure 1: Typing rules for Curry programs equivalent to a Type expression). A function Type Declaration f::τ is considered as an assignment of the Type scheme ∀α1, . . . , αn.τ to f , where α1, . . . , αn are all Type variables occurring in τ . The Type τ is called a generic instance of the Type scheme ∀α1, . . . , αn.τ ′ if there is a substitution σ = {α1 7→ τ1, . . . , αn 7→ τn} on the Types with σ(τ ′) = τ . The Types of all defined functions are collected in a Type environment A which is a mapping from identifiers to Type schemes. It contains at least the Type schemes of the defined functions and an assignment of Types for some local variables. An expression e is well-Typed and has Type τ w.r.t. a Type environment A if A ` e :: τ is derivable according to the inference rules shown in Figure 1. A defining equation f t1 . . . tn = e [where x free] is well-Typed w.r.t. a Type environment A if A(f) = ∀α1, . . . , αm.τ [and A(x) is a Type expression] and A ` \t1-> · · · \tn->e :: τ is derivable according to the above inference rules. A conditional equation l | c = r is considered (for the purpose of typing) as syntactic sugar for l = cond c r where cond is a new function with Type scheme A(cond) = ∀α.Success→ α→ α. A program is well-Typed if all its rules are well-Typed with a unique assignment of Type schemes to defined functions.10 Note that the following recursive definition is a well-Typed Curry program according to the definition above (and the Type definitions given in the prelude, cf. Appendix B): f :: [a] -> [a] f x = if length x == 0 then fst (g x x) else x g :: [a] -> [b] -> ([a],[b]) g x y = (f x, f y) h :: ([Int],[Bool]) h = g [3,4] [True,False] However, if the Type Declaration for g is omitted, the usual Type inference algorithms are not able Here we assume that all local Declarations are eliminated by the transformations described in Appendix D.8.

De Survey - One of the best experts on this subject based on the ideXlab platform.

Sooha Park Lee - One of the best experts on this subject based on the ideXlab platform.

  • Implementation Of NCL: NIIIP Common Language For Achieving Information SHARING AND INTEROPERABILITY AMONG HETEROGENEOUS SYSTEMS
    1996
    Co-Authors: Sooha Park Lee
    Abstract:

    : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : vii CHAPTERS : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2 THE SYNTAX AND SEMANTICS OF NCL : : : : : : : : : : : : : : : : 6 2.1 The Overall Syntax Structure of NCL : : : : : : : : : : : : : : : : : : 6 2.2 Class Declaration Statement : : : : : : : : : : : : : : : : : : : : : : : 9 2.2.1 Schema Declaration : : : : : : : : : : : : : : : : : : : : : : : : 11 2.2.2 Type Declaration : : : : : : : : : : : : : : : : : : : : : : : : : 11 2.2.3 Entity Declaration : : : : : : : : : : : : : : : : : : : : : : : : 12 2.2.4 SuperType/SubType Declaration : : : : : : : : : : : : : : : : : 12 2.2.5 Explicit Attribute : : : : : : : : : : : : : : : : : : : : : : : : : 13 2.2.6 Constraints on Attribute : : : : : : : : : : : : : : : : : : : : : 14 2.2.7 Derived Attribute : : : : : : : : : : : : : : : : : : : : :..

Alberto Bacchelli - One of the best experts on this subject based on the ideXlab platform.

  • investigating Type Declaration mismatches in python
    2018 IEEE Workshop on Machine Learning Techniques for Software Quality Evaluation (MaLTeSQuE), 2018
    Co-Authors: Luca Pascarella, Achyudh Ram, Azqa Nadeem, Dinesh Bisesser, Norman Knyazev, Alberto Bacchelli
    Abstract:

    Past research provided evidence that developers making code changes sometimes omit to update the related documentation, thus creating inconsistencies that may contribute to faults and crashes. In dynamically Typed languages, such as Python, an inconsistency in the documentation may lead to a mismatch in Type Declarations only visible at runtime. With our study, we investigate how often the documentation is inconsistent in a sample of 239 methods from five Python open-source software projects. Our results highlight that more than 20% of the comments are either partially defined or entirely missing and that almost 1% of the methods in the analyzed projects contain Type inconsistencies. Based on these results, we create a tool, PyID, to early detect Type mismatches in Python documentation and we evaluate its performance with our oracle.