formal parameter

2011 ◽  
Keyword(s):  
Formal Parameter

Datatypes

1994 ◽  
Author(s):  
Douglas Schenck ◽  
Peter Wilson
Keyword(s):  
Named Entities ◽  
Generic Type ◽  
Formal Parameter ◽  
Actual Parameter ◽  
Type Parameter ◽  
Local Variable ◽  
The Way

This chapter explains the EXPRESS pseudotypes and datatypes. You will also want to read about defined types and entity types, both of which are covered in Chapter 11. Datatypes represent domains of values. A domain is the set of possible values associated with an attribute, local variable or formal parameter. Datatype values can be operated upon as explained in Chapter 14. EXPRESS is fussy about the way datatypes are used. The datatypes are grouped this way: • Pseudo (Generic and Aggregate — see 10.1) • Simple (Integer, String, etc. — see 10.2) • Collection (Array, List, etc. — see 10.3) • Enumeration and Select (see 10.4 and 10.5). • Named (entities and defined types — Chapter 11) Then, the context in which a reference to a datatype is made will be • as the type of an attribute, • as the type of a local variable, • as the type of a formal parameter, or • as the underlying type of a defined type. At last, a summary of the datatypes that can be used in the different contexts is given in Table 10.1. Notice that pseudotypes can only be used as formal parameter types and, the enumeration and select types can only be used as the underlying types of defined types. Pseudotypes are used only as the types of the formal parameters of functions and procedures. They can be regarded as templates into which various specific types can be placed. See 11.5.1 for more about formal parameters. The domain of a generic pseudotype is every conceivable value. When a procedure or function that has a generic type parameter is invoked it will accept any kind of actual parameter. No questions asked! Functions or procedures that use formal parameters typed as generic must be prepared to deal with whatever actual stuff is tossed its way and any operations performed on them will depend on the specific type of the actual parameter. Generic parameters should never be used when a more specific type can be used instead. In any event, the mechanics involved in writing an algorithm that is capable of handling every possible input value are tricky. The message is: Don’t use generic parameters unless you simply have to.

formal parameter mode

2011 ◽  
Keyword(s):  
Formal Parameter

formal parameter

2000 ◽  
pp. 630-630
Author(s):  
Martin H. Weik
Keyword(s):  
Formal Parameter

scholarly journals EXTENSION OF FUNCTORS FOR ALGEBRAS OF FORMAL DEFORMATION

2013 ◽  
Vol 56 (1) ◽  
pp. 103-141
Author(s):  
ANA RITA MARTINS ◽  
TERESA MONTEIRO FERNANDES ◽  
DAVID RAIMUNDO
Keyword(s):  
Fourier Transform ◽  
Open Subset ◽  
Inverse Image ◽  
Explicit Construction ◽  
Comparison Theorems ◽  
Complex Manifolds ◽  
Formal Parameter ◽  
Formal Deformation ◽  
Characteristic Case ◽  
Vanishing Cycles

AbstractSuppose we are given complex manifoldsXandYtogether with substacks$\mathcal{S}$and$\mathcal{S}'$of modules over algebras of formal deformation$\mathcal{A}$onXand$\mathcal{A}'$onY, respectively. Also, suppose we are given a functor Φ from the category of open subsets ofXto the category of open subsets ofYtogether with a functorFof prestacks from$\mathcal{S}$to$\mathcal{S}'\circ\Phi$. Then we give conditions for the existence of a canonical functor, extension ofFto the category of coherent$\mathcal{A}$-modules such that the cohomology associated to the action of the formal parameter$\hbar$takes values in$\mathcal{S}$. We give an explicit construction and prove that when the initial functorFis exact on each open subset, so is its extension. Our construction permits to extend the functors of inverse image, Fourier transform, specialisation and micro-localisation, nearby and vanishing cycles in the framework of$\mathcal{D}[[\hbar]]$-modules. We also obtain the Cauchy–Kowalewskaia–Kashiwara theorem in the non-characteristic case as well as comparison theorems for regular holonomic$\mathcal{D}[[\hbar]]$-modules and a coherency criterion for proper direct images of good$\mathcal{D}[[\hbar]]$-modules.

scholarly journals Diagrammatic logic applied to a parameterisation process

2010 ◽  
Vol 20 (4) ◽  
pp. 639-654 ◽  
Author(s):  
CÉSAR DOMÍNGUEZ ◽  
DOMINIQUE DUVAL
Keyword(s):  
Category Theory ◽  
Formal Parameter ◽  
Actual Parameter ◽  
Definition Of ◽  
The Given ◽  
Parameter Passing

This paper provides an abstract definition of a class of logics, called diagrammatic logics, together with a definition of morphisms and 2-morphisms between them. The definition of the 2-category of diagrammatic logics relies on category theory, mainly on adjunction, categories of fractions and limit sketches. This framework is applied to the formalisation of a parameterisation process. This process, which consists of adding a formal parameter to some operations in a given specification, is presented as a morphism of logics. Then the parameter passing process for recovering a model of the given specification from a model of the parameterised specification and an actual parameter is shown to be a 2-morphism of logics.

scholarly journals Data Types as Functions

1978 ◽  
Vol 7 (89) ◽  
Author(s):  
Brian H. Mayoh
Keyword(s):  
Data Type ◽  
Extended Version ◽  
Data Types ◽  
Formal Parameter ◽  
Actual Parameter ◽  
Definition Of ◽  
Simple Definition

This paper introduces a new, simple definition of what a data type is. This definition gives one possible solution of the theoretical problems: when can an actual parameter of type T be substituted for a formal parameter of type T'? When can a type T' be implemented as another type T''? The preprint is an extended version of a paper presented at MFCS 78, Zakopane.

Formal Parameter Synthesis for Energy-Utility-Optimal Fault Tolerance

2018 ◽  
pp. 78-93 ◽  
Author(s):  
Linda Herrmann ◽  
Christel Baier ◽  
Christof Fetzer ◽  
Sascha Klüppelholz ◽  
Markus Napierkowski
Keyword(s):  
Fault Tolerance ◽  
Formal Parameter ◽  
Parameter Synthesis

scholarly journals Properties of active galaxies at the extreme of Eigenvector 1

2018 ◽  
Vol 613 ◽  
pp. A38 ◽  
Author(s):  
M. Śniegowska ◽  
B. Czerny ◽  
B. You ◽  
S. Panda ◽  
J.-M. Wang ◽  
...  
Keyword(s):  
Black Hole ◽  
Measurement Errors ◽  
Active Galaxies ◽  
Sloan Digital Sky Survey ◽  
Black Hole Mass ◽  
Formal Parameter ◽  
Sky Survey ◽  
Open Issue ◽  
Uniform Group

Context. Eigenvector 1 (EV1) is the formal parameter which allows the introduction of some order in the properties of the unobscured type 1 active galaxies. Aims. We aim to understand the nature of this parameter by analyzing the most extreme examples of quasars with the highest possible values of the corresponding eigenvalues RFe. Methods. We selected the appropriate sources from the Sloan Digital Sky Survey (SDSS) and performed detailed modeling, including various templates for the Fe II pseudo-continuum and the starlight contribution to the spectrum. Results. Out of 27 sources with RFe larger than 1.3 and with the measurement errors smaller than 20% selected from the SDSS quasar catalog, only six sources were confirmed to have a high value of RFe, defined as being above 1.3. All other sources have an RFe of approximately 1. Three of the high RFe objects have a very narrow Hβ line, below 2100 km s−1 but three sources have broad lines, above 4500 km s−1, that do not seem to form a uniform group, differing considerably in black hole mass and Eddington ratio; they simply have a very similar EW([OIII]5007) line. Therefore, the interpretation of the EV1 remains an open issue.

Symbols

1994 ◽  
Author(s):  
Douglas Schenck ◽  
Peter Wilson
Keyword(s):  
Information Model ◽  
Lower Half ◽  
Data Type ◽  
Vertical Line ◽  
Horizontal Line ◽  
Model Composition ◽  
Formal Parameter ◽  
The Right

EXPRESS-G has three basic kinds of symbol; defintion, relation, and composition. Definition and relation symbols are used to define the contents and structure of an information model. Composition symbols enable the diagrams to be spread across many physical pages. A definition symbol is a rectangle enclosing the name of the thing being defined. The type of the definition is denoted by the style of the box. Symbols are provided for EXPRESS simple types, defined types, entity types and schemas. The EXPRESS language offers a number of predefined simple types, namely Binary, Boolean, Integer, Logical, Number, Real and String. These are the terminal types of the language. The symbol for them is a solid rectangle with a double vertical line at its right end. The name of the type is enclosed within the box, as shown in Figure 18.1. The EXPRESS Generic pseudotype is not represented in EXPRESS-G as it is only used as a formal parameter to a function or procedure, and EXPRESS-G does not have these. The symbols for the select, enumeration and defined data type are dashed boxes as shown in Figure 18.2. • The symbol for a defined data type is a dashed box enclosing the name of the type. • The symbol for a select type is a dashed box with a double vertical line at the left end, enclosing the name of the select. • The symbol for an enumeration type is a dashed box with a double vertical line at the right end, enclosing the name of the enumeration. Although an enumeration is not a terminal of the EXPRESS language (because its definition includes the enumerated things), it is a terminal of the EXPRESS-G language. Figure 18.3 shows the symbol for an entity, which is a solid rectangle enclosing the name of the entity. The symbol for a schema is shown in Figure 18.3. It is a solid rectangle divided in half by a horizontal line. The name of the schema is written in the upper half of the rectangle. The lower half of the symbol is empty. EXPRESS-G does not support any notation for either function or procedure definitions.

scholarly journals DEFORMATIONS AND INVERSION FORMULAS FOR FORMAL AUTOMORPHISMS IN NONCOMMUTATIVE VARIABLES

2007 ◽  
Vol 17 (02) ◽  
pp. 261-288 ◽  
Author(s):  
WENHUA ZHAO
Keyword(s):  
Inversion Formula ◽  
Integral Domain ◽  
Rooted Trees ◽  
Cauchy Problems ◽  
Inversion Formulas ◽  
Formal Parameter ◽  
Free Variables ◽  
And Inversion ◽  
Special Case

Let z = (z1, z2,…, zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be any unital integral domain of any characteristic and Ft(z) = z - Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉×n and the order o(Ht(z))≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F(z):= z - Ht=1(z) when it makes sense (for example, when Ht(z) ∈ k[t]〈〈z〉〉×n). The inverse map Gt(z) of Ft(z) can always be written as Gt(z) = z+Mt(z) with Mt(z) ∈ k[[t]]〈〈z〉〉×n and o(Mt(z)) ≥ 2. In this paper, we first derive the PDEs satisfied by Mt(z) and u(Ft), u(Gt) ∈ k[[t]]〈〈z〉〉 with u(z) ∈ k〈〈z〉〉 in the general case as well as in the special case when Ht(z) = tH(z) for some H(z) ∈ k〈〈z〉〉×n. We also show that the elements above are actually characterized by certain Cauchy problems of these PDEs. Secondly, we apply the derived PDEs to prove a recurrent inversion formula for formal maps in noncommutative variables. Finally, for the case char. k = 0, we derive an expansion inversion formula by the planar binary rooted trees.

Sign in / Sign up

Export Citation Format

Share Document