passt implements a thin layer between guest and host, that only implements what's strictly needed to pretend processes are running locally. The TCP adaptation doesn't keep per-connection packet buffers, and reflects observed sending windows and acknowledgements between the two sides. This TCP adaptation is needed as passt runs without the CAP_NET_RAW capability: it can't create raw IP sockets on the pod, and therefore needs to map packets at Layer-2 to Layer-4 sockets offered by the host kernel.

Also provides pasta, which similarly to slirp4netns, provides networking to containers by creating a tap interface available to processes in the namespace, and mapping network traffic outside the namespace using native Layer-4 sockets.

Catatonit is a simple container init tool developed as a rewrite of initrs in C due to the need for static compilation of Rust binaries with musl. Inspired by other container inits like tini and dumb-init, catatonit focuses on correct signal handling, utilizing signalfd(2) for improved stability. Its main purpose is to support the key usage by docker-init: /dev/init – <your program>, with minimal additional features planned.

This package provides Container Network Interface (CNI) plugins to configure network interfaces in Linux containers.

Podman (the POD MANager) is a tool for managing containers and images, volumes mounted into those containers, and pods made from groups of containers.

Not all commands are working out of the box due to requiring additional binaries to be present in the $PATH.

To get podman compose working, install either podman-compose or docker-compose packages.

To get podman machine working, install qemu-minimal, and openssh packages.

convmv is a file renamer, that converts between different encodings, e.g. from ISO-8859-1 to UTF-8. It is particularly usefuls for files with names, that display incorrectly.

This project contains an extended "Standard Library" for Coq called coq-std++. The key features are:

• Great number of definitions and lemmas for common data structures such as lists, finite maps, finite sets, and finite multisets.

• Type classes for common notations (like ∅, ∪, and Haskell-style monad notations) so that these can be overloaded for different data structures.

• It uses type classes to keep track of common properties of types, like it having decidable equality or being countable or finite.

• Most data structures are represented in canonical ways so that Leibniz equality can be used as much as possible (for example, for maps we have m1 = m2 iff ∀ i, m1 !! i = m2 !! i). On top of that, the library provides setoid instances for most types and operations.

• Various tactics for common tasks, like an ssreflect inspired done tactic for finishing trivial goals, a simple breadth-first solver naive_solver, an equality simplifier simplify_eq, a solver solve_proper for proving compatibility of functions with respect to relations, and a solver set_solver for goals involving set operations.

• The library is dependency- and axiom-free.

Coquelicot is an easier way of writing formulas and theorem statements, achieved by relying on total functions in place of dependent types for limits, derivatives, integrals, power series, and so on. To help with the proof process, the library comes with a comprehensive set of theorems that cover not only these notions, but also some extensions such as parametric integrals, two-dimensional differentiability, asymptotic behaviors. It also offers some automations for performing differentiability proofs. Moreover, Coquelicot is a conservative extension of Coq's standard library and provides correspondence theorems between the two libraries.

Formalizing syntactic theories with variable binders is not easy. Autosubst is a library for the Coq proof assistant to automate this process. Given an inductive definition of syntactic objects in de Bruijn representation augmented with binding annotations, Autosubst synthesizes the parallel substitution operation and automatically proves the basic lemmas about substitutions. This library contains an automation tactic that solves equations involving terms and substitutions. This makes the usage of substitution lemmas unnecessary. The tactic is based on our current work on a decision procedure for the equational theory of an extension of the sigma-calculus by Abadi et al. The library is completely written in Coq and uses Ltac to synthesize the substitution operation.

Proof General is a major mode to turn Emacs into an interactive proof assistant to write formal mathematical proofs using a variety of theorem provers.

Interval provides vernacular files containing tactics for simplifying the proofs of inequalities on expressions of real numbers for the Coq proof assistant.

Coq is a proof assistant for higher-order logic, which allows the development of computer programs consistent with their formal specification. It is developed using Objective Caml and Camlp5.

Coq is a proof assistant for higher-order logic, which allows the development of computer programs consistent with their formal specification. It is developed using Objective Caml and Camlp5.

Mathematical Components for Coq has its origins in the formal proof of the Four Colour Theorem. Since then it has grown to cover many areas of mathematics and has been used for large scale projects like the formal proof of the Odd Order Theorem.

The library is written using the Ssreflect proof language that is an integral part of the distribution.

Gappa is a tool intended to help verifying and formally proving properties on numerical programs dealing with floating-point or fixed-point arithmetic. It has been used to write robust floating-point filters for CGAL and it is used to certify elementary functions in CRlibm. While Gappa is intended to be used directly, it can also act as a backend prover for the Why3 software verification plateform or as an automatic tactic for the Coq proof assistant.

Equations provides a notation for writing programs by dependent pattern-matching and (well-founded) recursion in Coq. It compiles everything down to eliminators for inductive types, equality and accessibility, providing a definitional extension to the Coq kernel.

Bignums is a coq library of arbitrary large numbers. It provides BigN, BigZ, BigQ that used to be part of Coq standard library.

This library is an extension of coq-mathcomp which supports finite sets and finite maps on choicetypes (rather than finite types). This includes support for functions with finite support and multisets. The library also contains a generic order and set library, which will eventually be used to subsume notations for finite sets.

This package provides a survey of programming language semantics styles, from natural semantics through structural operational, axiomatic, and denotational semantics, for a miniature example of an imperative programming language. Their encoding, the proofs of equivalence of different styles, abstract interpretation, and the proof of soundess obtained from axiomatic semantics or abstract interpretation is done in Coq. The tools can be run inside Coq, thus making them available for proof by reflection. Code can also be extracted and connected to a yacc-based parser, thanks to the use of a functor parameterized by a module type of strings. A hand-written parser is also provided in Coq, without associated proofs.

The package is used for reasoning with big enough objects (mostly natural numbers). This package is essentially for backward compatibility purposes as bigenough will be subsumed by the near tactics. The formalization is based on the Mathematical Components library.

Coq is a proof assistant for higher-order logic, which allows the development of computer programs consistent with their formal specification. It is developed using Objective Caml and Camlp5.

Flocq (Floats for Coq) is a floating-point formalization for the Coq system. It provides a comprehensive library of theorems on a multi-radix multi-precision arithmetic. It also supports efficient numerical computations inside Coq.

Coq is a proof assistant for higher-order logic, which allows the development of computer programs consistent with their formal specification. It is developed using Objective Caml and Camlp5.

GNU cpio copies files into or out of cpio or tar archives. Indeed, many formats are supported, including legacy formats. The format is determined automatically by the program and is handled appropriately. Furthermore, the location of the archive is not important. It can be another file on the drive, a tape, or data on a pipe.

lexy is a parser combinator library for C++17 and later.