Results 1  10
of
436
InductiveDataType Systems
, 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schem ..."
Abstract

Cited by 821 (23 self)
 Add to MetaCart
;General Schema", whichgeneral39I theusual recursor definitions fornatural numbers and simil9 "basic inductive types". This combined lmbined was shown to bestrongl normalIk39f The purpose of this paper is toreformul33 and extend theGeneral Schema in order to make it easil extensibl3 to capture a
Universal coalgebra: a theory of systems
, 2000
"... In the semantics of programming, nite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with in finite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certa ..."
Abstract

Cited by 408 (42 self)
 Add to MetaCart
for certain types of automata and more generally, for (transition and dynamical) systems. An important property of initial algebras is that they satisfy the familiar principle of induction. Such a principle was missing for coalgebras until the work of Aczel (NonWellFounded sets, CSLI Leethre Notes, Vol. 14
Structural Induction and Coinduction in a Fibrational Setting
 Information and Computation
, 1997
"... . We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for in ..."
Abstract

Cited by 85 (16 self)
 Add to MetaCart
. We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle
Severe Testing as a Basic Concept in a NeymanPearson Philosophy of Induction
 BRITISH JOURNAL FOR THE PHILOSOPHY OF SCIENCE
, 2006
"... Despite the widespread use of key concepts of the Neyman–Pearson (N–P) statistical paradigm—type I and II errors, significance levels, power, confidence levels—they have been the subject of philosophical controversy and debate for over 60 years. Both current and longstanding problems of N–P tests s ..."
Abstract

Cited by 52 (21 self)
 Add to MetaCart
Despite the widespread use of key concepts of the Neyman–Pearson (N–P) statistical paradigm—type I and II errors, significance levels, power, confidence levels—they have been the subject of philosophical controversy and debate for over 60 years. Both current and longstanding problems of N–P tests
Constructions, Inductive Types and Strong Normalization
, 1993
"... This thesis contains an investigation of Coquand's Calculus of Constructions, a basic impredicative Type Theory. We review syntactic properties of the calculus, in particular decidability of equality and typechecking, based on the equalityasjudgement presentation. We present a settheoretic ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
This thesis contains an investigation of Coquand's Calculus of Constructions, a basic impredicative Type Theory. We review syntactic properties of the calculus, in particular decidability of equality and typechecking, based on the equalityasjudgement presentation. We present a set
Kimchi A: Autophagy as a cell death and tumor suppressor mechanism. Oncogene 2004
"... Autophagy is characterized by sequestration of bulk cytoplasm and organelles in double or multimembrane autophagic vesicles, and their delivery to and subsequent degradation by the cell’s own lysosomal system. Autophagy has multiple physiological functions in multicellular organisms, including prote ..."
Abstract

Cited by 122 (3 self)
 Add to MetaCart
protein degradation and organelle turnover. Genes and proteins that constitute the basic machinery of the autophagic process were first identified in the yeast system and some of their mammalian orthologues have been characterized as well. Increasing lines of evidence indicate that these molecular
Reasoning with inductively defined relations in the HOL theorem prover
, 1992
"... Abstract: Inductively defined relations are among the basic mathematical tools of computer science. Examples include evaluation and computation relations in structural operational semantics, labelled transition relations in process algebra semantics, inductivelydefined typing judgements, and proof ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
Abstract: Inductively defined relations are among the basic mathematical tools of computer science. Examples include evaluation and computation relations in structural operational semantics, labelled transition relations in process algebra semantics, inductivelydefined typing judgements, and proof
Higher Inductive Types in Homotopy Type Theory
"... Homotopy Type Theory (HoTT) refers to the homotopical interpretation [1] of MartinLöf’s intensional, constructive type theory (MLTT) [5], together with several new principles motivated by that interpretation. Voevodsky’s Univalent Foundations program [6] is a conception for a new foundation for mat ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
for mathematics, based on HoTT and implemented in a proof assistant like Coq [2]. Among the new principles to be added to MLTT are the Univalence Axiom [4], and the socalled higher inductive types (HITs), a new idea due to Lumsdaine and Shulman which allows for the introduction of some basic spaces
Electromagnetic Induction
"... Existing rules for calculating induced e.m.f. are examined and a nonrelativistic expression is developed for the force on a charged particle moving in the vicinity of a timevarying but stationary source of magnetic field. This expression is used to predict the e.m.f. induced in three basic electrom ..."
Abstract
 Add to MetaCart
Existing rules for calculating induced e.m.f. are examined and a nonrelativistic expression is developed for the force on a charged particle moving in the vicinity of a timevarying but stationary source of magnetic field. This expression is used to predict the e.m.f. induced in three basic
Verb Interpretation for Basic Action Types: Annotation, Ontology Induction and Creation of Prototypical Scenes
"... In the last 20 years dictionaries and lexicographic resources such as WordNet have started to be enriched with multimodal content. Short videos depicting basic actions support the user’s need (especially in second language acquisition) to fully understand the range of applicability of verbs. The IMA ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In the last 20 years dictionaries and lexicographic resources such as WordNet have started to be enriched with multimodal content. Short videos depicting basic actions support the user’s need (especially in second language acquisition) to fully understand the range of applicability of verbs
Results 1  10
of
436