high < higher < highlighting

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f KwdFr.f Mesh.f MeshFr.f Teeft.f

List of bibliographic references indexed by higher

Number of relevant bibliographic references: 91.
[0-20] [0 - 20][0 - 50][20-40]

Ident.	Authors (with country if any)	Title
000592 (2015-04-11)	Emmanuel Hainry [France] ; Romain Péchoux [France]	Higher order interpretations for Basic Feasible Functions
000839 (2014-12-10)	Hugo Férée [France]	Higher order complexity and computable analysis
001111 (2013-07-08)	Hugo Férée [France] ; Mathieu Hoyrup [France]	Higher-order complexity in analysis
001184 (2013-06-06)	Samuel Nowakowski [France] ; Nathalie Issenmann [France]	Higher Education and Research in France - Presentation of the university of Lorraine and presentation of the french higher education system
001620 (2013)	Pierre Lescanne [France]	Common Knowledge Logic in a Higher Order Proof Assistant
002331 (2011-05-30)	Cody Roux [France]	Refinement types as higher order dependency pairs
002481 (2011-01-05)	Cody Roux [France]	Refinement Types as Higher Order Dependency Pairs
002738 (2011)	Christoph Benzmüller [États-Unis]	Combining and automating classical and non-classical logics in classical higher-order logics
003767 (2009)	Yves Guiraud [France] ; Philippe Malbos [France]	Higher-dimensional categories with finite derivation type
003871 (2009)	Michael Leuschel [Allemagne] ; Dominique Cansell [France] ; Michael Butler [Royaume-Uni]	Validating and Animating Higher-Order Recursive Functions in B
003A32 (2009)	Oana Andrei [France] ; Hélène Kirchner [France]	A Higher-Order Graph Calculus for Autonomic Computing
003B65 (2009)	Keiichirou Kusakari [Japon] ; Yasuo Isogai [Japon] ; Masahiko Sakai [Japon] ; Frédéric Blanqui [France]	Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
003E43 (2008-09-19)	Oana Andrei [France] ; Hélène Kirchner [France]	A Higher-Order Graph Calculus for Autonomic Computing
004014 (2008-05-09)	Guillaume Burel [France]	Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
004731 (2007-09-22)	Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France]	Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs
004A76 (2007)	Paolo Baldan [Italie] ; Clara Bertolissi [France] ; Horatiu Cirstea [France] ; Claude Kirchner [France]	A rewriting calculus for cyclic higher-order term graphs
004E13 (2007)	Michael Leuschel ; Dominique Cansell [France] ; Michael Butler	Validating and Animating Higher-Order Recursive Functions in B
004F56 (2006-10-31)	Wan Chiu Li [France] ; Bruno Vallet [France] ; Nicolas Ray [France] ; Bruno Lévy [France]	Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces
005038 (2006-08-15)	Frédéric Blanqui [France]	Higher-order dependency pairs
005470 (2006)	Frédéric Blanqui [France] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]	Higher-Order Termination: From Kruskal to Computability
005521 (2006)	Frédéric Blanqui Inria [France] ; Colin Riba Inpl [France]	Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "higher" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "higher" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    higher
}}

---

This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022