scientific article; zbMATH DE number 2003149

zbMATH Open1023.03532MaRDI QIDQ4435459FDOQ4435459

Authors: Ana Bove 

Publication date: 12 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2646/26460039.htm

Title of this publication is not available (Why is that?)

Recommendations

• Modelling general recursion in type theory
• scientific article; zbMATH DE number 1863381
• Simple general recursion in type theory
• Computation by Prophecy
• Terminating general recursion

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Second- and higher-order arithmetic and fragments (03F35)

Cited In (22)

• Typed Lambda Calculi and Applications
• Type inference with recursive types: Syntax and semantics
• General Recursion via Coinductive Types
• Using Structural Recursion for Corecursion
• Title not available (Why is that?)
• Galois Connections for Recursive Types
• Computation by Prophecy
• Another look at function domains
• General recursive functions in a very simply interpretable typed \(\lambda\)-calculus
• Title not available (Why is that?)
• A Type of Partial Recursive Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inductive and coinductive components of corecursive functions in Coq
• Modelling general recursion in type theory
• Terminating general recursion
• Title not available (Why is that?)
• A Generalized Modality for Recursion
• Partial and nested recursive function definitions in higher-order logic
• Simple general recursion in type theory
• Constructing recursion operators in intuitionistic type theory
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435459)