Filters








34,296 Hits in 3.8 sec

Page 816 of Mathematical Reviews Vol. , Issue 86b [page]

1986 Mathematical Reviews  
Lastly, we present experiments performed with an implemented interpreter.” Olderog, Ernst-Riidiger 86b:68037 Correctness of programs with Pascal-like procedures without global variables. Theoret.  ...  We construct higher-order theories for higher-order specifications. For higher-order models we discuss existence of initial models and completeness of higher-order theo- ries.”  ... 

Model Checking and Higher-Order Recursion [chapter]

Hardi Hungar
1999 Lecture Notes in Computer Science  
Technically, the result follows from the decidability of the emptiness problem of the trax;e language of a macro graph with fairness. The decision procedure is given in form of a tableau system.  ...  The generation mechanism of macro graphs is of higher-order nature and relates to the context-free one like macro grammars [Fis68] relate to context-free grammars.  ...  Also, a specialized procedure for the full mu-calculus should be obtainable.  ... 
doi:10.1007/3-540-48340-3_14 fatcat:go6uwsglj5esvlm2742n3szm7q

Hot: A concurrent automated theorem prover based on higher-order tableaux [chapter]

Karsten Konrad
1998 Lecture Notes in Computer Science  
Hot is an automated higher-order theorem prover based on HT E, an extensional higher-order tableaux calculus.  ...  The rst part of this paper introduces an improved variant of the calculus which closely corresponds to the proof procedure implemented in Hot.  ...  Kohlhase's article Higher-Order Tableaux Koh95] presents a free variable tableau calculus for classical higher-order logic which includes substitutivity of equivalence.  ... 
doi:10.1007/bfb0055140 fatcat:tuxfckgj5bao5awpbid6rhe2ha

An Expansion Formula with Higher-Order Derivatives for Fractional Operators of Variable Order

Ricardo Almeida, Delfim F. M. Torres
2013 The Scientific World Journal  
We obtain approximation formulas for fractional integrals and derivatives of Riemann-Liouville and Marchaud types with a variable fractional order.  ...  The approximations involve integer-order derivatives only. An estimation for the error is given. The efficiency of the approximation method is illustrated with examples.  ...  Fractional Variational Calculus of Variable Order.  ... 
doi:10.1155/2013/915437 pmid:24319382 pmcid:PMC3844179 fatcat:m3qssknjabchdoaevmjmk34u7u

Page 4813 of Mathematical Reviews Vol. , Issue 86j [page]

1986 Mathematical Reviews  
re- lation variables, weak higher-order) and assumed expressiveness and oracle calls with respect to this extended assertion language.  ...  With the restriction on global vari- ables the result of the transformation is essentially L4. The com- pleteness result for L4 is again based on a transformation.  ... 

A π-calculus Process Semantics of Concurrent Idealised ALGOL [chapter]

Christine Röckl, Davide Sangiorgi
1999 Lecture Notes in Computer Science  
We discuss laws and examples which have served as benchmarks to various semantics, and a more complex example involving procedures of higher order.  ...  We rst present an operational semantics for CIA, given by SOS rules and a contextual form of behavioural equivalence; then a -calculus semantics.  ...  Reddy for helpful discussions.  ... 
doi:10.1007/3-540-49019-1_21 fatcat:cqhjzoa5bzbyrnv5gegh4a3e44

Adaptive Particle Swarm Algorithm for Parameters Tuning of Fractional Order PID Controller

Chaobo Chen, Li Hu, Lei Wang, Song Gao, Changhong Li
2016 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
Finally, adaptive particle swarm optimization method of fractional order PID controller is applied to integer order and fractional order of the controlled system for performance simulation in time domain  ...  In order to optimize the parameters of fractional order PID controller of complex system, an adaptive particle swarm optimization (PSO) method is proposed to realize the parameters adjustment.  ...  Fractional-order Calculus For the study of fractional order system, fractional calculus is a basic starting point and a branch of calculus in which the differentiation and integration of a function is  ... 
doi:10.12928/telkomnika.v14i2.2370 fatcat:2nifpqmoareftdvzcs5tgypkvi

Tabling for Higher-Order Logic Programming [chapter]

Brigitte Pientka
2005 Lecture Notes in Computer Science  
a more robust and more efficient proof procedure.  ...  To achieve a space and time efficient implementation, we rely on substitution factoring and higher-order substitution tree indexing.  ...  In the case of the propositional sequent calculus, we obtain a decision procedure for free.  ... 
doi:10.1007/11532231_5 fatcat:i7fltdjlbndtjbsxcrnc6dgsom

Dynamics and Secure Information Flow for a Higher-Order Pi-Calculus [chapter]

Martin Pettai, Peeter Laud
2013 Lecture Notes in Computer Science  
We show how a type system for secure information flow for a π-calculus with higher-order λ-abstractions can be extended with dynamics without weakening the non-interference guarantees.  ...  The type system for the π-calculus ensures that the traffic on high channels does not influence the traffic on low channels. λ-abstractions make it possible to send processes over channels.  ...  Our work also extends the existing type-based information flow analyses for higher-order languages.  ... 
doi:10.1007/978-3-642-41488-6_7 fatcat:4xkqxdkdyzb4loktpgxkkw6cly

Elf: A meta-language for deductive systems [chapter]

Frank Pfenning
1994 Lecture Notes in Computer Science  
This allows variables in the object language to be represented by variables in the metalanguage, using the technique of higher-order abstract syntax. Common operations Internet address:  ...  LF generalizes first-order terms by allowing objects from a dependently typed λ-calculus to represent object language expressions.  ...  Air Force under Contract F33615-90-C-1465, ARPA Order No. 7597.  ... 
doi:10.1007/3-540-58156-1_66 fatcat:7glq2iymc5fbrkxbe643r63u4m

Page 7535 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
Nonetheless, these procedures are a step (per- haps small, but still a step) towards a full understanding of the /p-calculus.  ...  The paper provides a methodological framework according to Lesniewski’s ideas that can be used to de- velop languages containing variables of the highest order, while enabling the definition of all constants  ... 

Specifying the Caltech asynchronous microprocessor

R.J.R. Back, A.J. Martin, K. Sere
1996 Science of Computer Programming  
We propose a specification strategy that is based on the idea of spatial decomposition of the program variable space.  ...  The action systems framework for modelling parallel programs is used to formally specify a microprocessor. First the microprocessor is specified as a sequential program.  ...  The exported identifiers are the variables and/or procedures declared global in d or a'.  ... 
doi:10.1016/0167-6423(95)00023-2 fatcat:dnnxkkot6ndxzknasgos64v4uq

The semantics of local storage, or what makes the free-list free?(Preliminary Report)

Joseph Y. Halpern, Albert R. Meyer, B. A. Trakhtenbrot
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
Procedures are entirely ezplained at a purely functional level -independent of the' interpretation of program constructs -by continuous models for X-calculus.  ...  Denotational semantics for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing} is given by translating programs into an appropriately typed X-calculus.  ...  Da for higher-order ~ by induction on types. Definition.  ... 
doi:10.1145/800017.800536 dblp:conf/popl/HalpernMT84 fatcat:os6z46gahbau3cgaadxy6igmpm

On Role Logic [article]

Viktor Kuncak, Martin Rinard
2004 arXiv   pre-print
We construct role logic using the ideas of de Bruijn's notation for lambda calculus, an encoding of first-order logic in lambda calculus, and a simple rule for implicit arguments of unary and binary predicates  ...  We show that the RL^2 fragment has the same expressive power as two-variable logic with counting C^2 and is therefore decidable.  ...  Scott Ananian for discussion of a draft of this paper in Spring 2003, we thank Derek Rayside, Mooly Sagiv, and Greta Yorsh for useful discussions, and Darko Marinov for comments on the paper.  ... 
arXiv:cs/0408018v1 fatcat:rs3rosm6k5frzbu7q43j5fb2wy

Page 2755 of Mathematical Reviews Vol. , Issue 87e [page]

1987 Mathematical Reviews  
Vari- ation of this action leads to second-order differential equations for the time development of the fundamental Regge calculus variables (edge lengths) and to a Hamiltonian constraint.  ...  The paper concludes with some suggestions for defining a sum over topologies in dimensions higher than two, where the problem is still unsolved.  ... 
« Previous Showing results 1 — 15 out of 34,296 results